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
3 ай бұрын
I need to do that soon
@prashantraj5202
4 ай бұрын
Got it in one go. Very nice explaination sir ❤
@Kuldeep1a
3 ай бұрын
I make my self change to understand (solve problem) all video of this channel
@kaustubhnagwekar4416
21 күн бұрын
great video😄
@atanukundu_10
4 ай бұрын
Thanks
@nandhakumarkr3147
4 ай бұрын
What is the time complexity of this solution ?
@nikoo28
4 ай бұрын
That will be O(n) since you are traversing the array only once
@luson_18
27 күн бұрын
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.
@THOSHI-cn6hg
2 ай бұрын
❤
@angelbroker924
3 ай бұрын
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??
Пікірлер: 14