Leetcode 209's problem statement is as follows: Given an array of positive integers and a positive integers, find the minimal length of a contiguous subarray whose sum is greater than or equal to the target sum. If there isn't one, return 0 instead. In this video I demonstrate how to solve this problem using the 'sliding window' approach.
Leetcode 209: [ Ссылка ]
Leetcode 209 Source Code: [ Ссылка ]
Chapters:
0:00 Intro
0:56 Sliding Window Solution
11:10 Outro
