Minimum Size Subarray Sum (LeetCode 209) | Full solution with animations | Variable Sliding Window

[@prashantraj5202]

Got it in one go. Very nice explaination sir ❤

[@hajeeramohamad7641]

Sir... please drop a recursion playlist. Pleaseeeee. I find it very confusing. The way you teach is very crisp and clear with all the illustrations.

[@nikoo28]

I need to do that soon

[@Kuldeep1a]

I make my self change to understand (solve problem) all video of this channel

[@luson_18]

if we are considering continuous sub arrays, then why can't we use prefix sum instead?
this is my code
int minSubArrayLen(int target, vector& nums) {
int sum=0;
for(int i=0;i=0;i--){
if(sum-nums[i]==target){
return count;
}
count++;
}
if(sum==target){
return count;
}
return 0;
}
but giving wrong answer for array [1,2,3,4,5], whose sum equal 11.

[@kaustubhnagwekar4416]

great video😄

[@atanukundu_10]

Thanks

[@nandhakumarkr3147]

What is the time complexity of this solution ?

[@nikoo28]

That will be O(n) since you are traversing the array only once

[@kanikadabral1223]

great

[@aashukumar6365]

awesome

[@angelbroker924]

From some of past day i found you and really impressed with you, and want to know more about you sir and connect with you in LinkedIn could we??

[@THOSHI-cn6hg]

❤

[@Homelander_30]

DSA sheet🙃