L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns
ฝัง
- เผยแพร่เมื่อ 4 ก.พ. 2025
- Notes/Codes/Problem links under step 10 of A2Z DSA Course: takeuforward.o...
Entire playlist: • Two Pointer and Slidin...
Follow us on our other social media handles: linktr.ee/take...
Petition to Striver - We want string playlist ASAP!!
Kb Ayega job meh budda hoh jaunga?
@@bipinsingh1490 mai sochu mujhe mil kyu nhi rhi strings ki playlist
Petition to Striver. We want strings.
I'm also waiting for it
yes we want strings
Yes striver sir 🙌
yes we want strings
Yes , please make series on strings.
Despite your busy schedule, you still manage to deliver invaluable content like this. I salute you, sir! Thank you very much for the teachings.
gurudev aaj ka leetcode daily dekh ke socha tha, striver ka sliding window kab aayega. aur aapne sun bhi li 😌
Man, this is really cool I am ngl I came across a sliding window sum today and was struggling today to do it, and here we are. Let's strive all the way. Thank you!
Thanks to your videos, I was able to enter the world of competitive programming and improve in DSA. Thank you so much!
bro, can i have your linked in ID
I don't have LinkedIn
what kind of dollar is that?
We lost your natural smile and natural energy.you are an inspiration to many.many people have been following your dsa sheet learning coding from scratch.hatsoff for your dedication towards work.hoping you come back with more energy.
This is something I was wishing 2 days back. Thanks Bhaiya :)
today leetcode problem of the day is based on sliding window topic , and i am searching for the playlist of sliding window on youtube and you just launched complete playlist of S.W ammazzing you are great 🙏🙏
Most awaited playlist🎉🎉🎉
LONG AWAITEDDD SERIESS!!!
THANK YOUUUUU STRIVERRRRRR SOO SOO OSOO MUCHHHHHH!!!!
I am currently studying the graph series once I am done. I will jump to this one!!
Thumbnail upgrade crazyyy…thanx for your efforts….eagerly waiting for strings
these kind of template videos are so awesome. useful for revision + wraps up the entire concept and makes it so much easier to understand the modifications in the different problems
The energy this man pushes is just unmatchable.
31:28 One more big optimization is possible in the longest subarray solution.
if (arr[r]>k) { r=r+1; l=r; sum=0}
Here if a number itself is greater than 'k' then no subarray with that element can be a valid substring. So, we can move both left and right pointers to the next element (i.e. arr[r+1])
while optimizing, you kinda have to expect the input that is the most time consuming.
@@antor.morsalin When looking to optimize, you should consider all cases and set up your code to shave off time or space wherever possible. But while calculating the time complexity, you should consider the most time consuming input.
Striver Bhaiya, I have just watched the introductory video of this playlist, and feels like it's a very cool explanation, I'm getting everything that you are saying for I am very grateful to you.
King is back with DSA..
thanks sir. i'm felling confident even before solving any specific problem to these pattern. concepts got clear now. Thanks a lot
i was here to revise , excellent JOB STRIVER !
Today i was thinking when will striver be teaching Sliding Window nd here it comes 🎉
Hi Striver, I'm not sure if this comment will reach you or not, but I just want to say one thing: I've been watching your videos for more than a year now and have covered a huge part of the graph and dynamic programming playlists. Whenever I watch your videos, I really fall in love with your teaching style, and of course, your smile, and sometimes your small jokes. I enjoy your videos, and it feels like you're not just my tutor; it feels like you're someone very close to me, teaching me with fun and pleasure. However, in your recent playlists, I totally miss that. It feels like you're not as friendly anymore; you're just a teacher like any other tutor. Whenever I watch videos from this playlist, sometimes I wonder what happened to you. Why are you so quiet now? Why don't you joke around anymore? After all, I love your work; it's just my opinion.
Best intro of any series on TH-cam 🎉
5:20 why no one is talking about the issue in the first problem , the first subarray isn't considered why? and no conditions given inside while loop why?
Here is the Correct code
int nums[] = new int[] {6,2,3,-1,-5,1,1};
int k = 3;
int left = 0;
int right = 0;
int sum = 0;
int maxSum = Integer.MIN_VALUE;
while(right
I was also wondering why no one has commented on that part!
we will calculate the sum for the first subarray also and we later compare it with the upcoming subarrays sum . hope I made it clear
before going to loop we can put maxSum = sum it also work fine:
#include
using namespace std;
int main(){
int k = 2;
vectorarr = {100,-2,1,-7,-1,10};
int sum = 0;
int maxsum = INT_MIN;
for (int i = 0; i < arr.size(); i++)sum = sum + arr[i];
int l = 0; int r = k-1;
maxsum = sum;//so we dont miss the sum of first subarray
while (r < arr.size()-1)
{
sum = sum - arr[l];
l++;
r++;
sum = sum + arr[r];
maxsum = max(maxsum,sum);
}
cout
basically we get that subarray sum in that iteration only. So no need to iterate the last element
@@purushottam108 hey, why did you write while(r
brilliant playlist striver , thank you , revising again and had lot of gaps , Thank you.
Petition to striver: we want string playlist
can't be simpler than this, hats off to you
we do it while(r
in his terms
he is conveying us as upto n-1 which is similar to r
in better approch, he is applying while(rk), you can put as while(sum>k && l
Hi, Thanks for the video first of all 😊, but at time 12:28, we can't break from the loop (as you did in else condition) as array can have negative elements further which will reduce sum and it can bring sum to less than or equal to k. That else condition is fine only when we don't have negative elements in the array.
At 21:05, we don't need the if condition to check if sum
At 21:55, isn’t it important for the while loop to have one more condition i.e l
Amazing explanation, but one input from my side would be that before updating the window, we should check if(l
i don't think so .. ig the first element is 15 then l++ will happen and r++ to so we will move to the second element and will create subarrays from there .
you are right but after incrementing l we are also incrementing r, then both l and r will point to the second element where we start creating subarrays .
Best video I have watched for Sliding window till date
Was waiting for this playlist from a long time. Thank u so much sir
Strings and Heaps playlist much needed
just saw this intro video and was able to solve the leetcode problem of the day (28th march) i am hyped up for this playlist!!
Optimization was so great 🥵 I never thought about improving 2n to n
VOTE FOR STRING PLAYLIST
Striver bro---we want string palylist
Was in waiting ✋️ list for this from a long time ⏲️.
Good optimisation, I had never thought around much regarding the optimisation wrt length we have
Very good content! I will buy your course once I got a job
Hey man, was waiting for this playlist for a long time. Appreciate your efforts
My motivation to continue grinding.
bro striver i am so grateful for all you do ...but please a simple request on the heaps and string playlist🙏
💯 / 10 teacher for dsa..
what an explanation man!!!! Hats off🤩
Most awaited series
Completed this amazing Video. Going to Blitz through every question/video now😈
what a great explanation Striver... Hats Off !!🤩🤩🙌🏻🙌🏻🫡
Thankyou so much Striver for all you efforts throughout in delivering us so much valuable content. Any student / working professional can now be able to transition their career without paying money for courses.
Would also like your insights on the point :
While preparing for interviews most of the aspirants are going through the videos solely and solving the question after completely watching the video. And also are feeling lazy trying to solve the question on our own. What is the best way to complete any topic without being lazy and how should an aspirant approach any topic/playlist?
Awesome Bro! Great teaching skills!
best concept explanation so far
Thank you so much ❤bhaiya apki sari videos kaffi helpful rahi hai hamare liye
very good work. thanks alot for doing this.
5:38 in this problem the sum of first subarray is not being considered, plz store it in a separate variable and put in maxi( ) as well, or after finding the sum using for loop assign max_sum= sum; in that case we dont need an extra variable
Best video on sliding window
Please upload greedy and heaps playlist too #striver
Greedy is coming next weekend
Thanks for nice explanation.2nd pattern will not work for negative number right
Starting me thoda problem hoga , but fir ek do baar dekhne pr samaz jata hai 😀
you are doing great work striver
great work sir🙌
Today i was thinking when will striver be teaching Sliding Window nd here it comes (2)
Amazing video 👏
bhaiya aaj ke contest me first time 3 question hua 🙂🙂🙂🙂because of you thank you
Thumbnail is lit tho❤
For else if(sum > k) break;
There may be negative elements in array right?
great video as allwlays sir
Very good explanation
this content is invaluable! can't thank you enough
thanks brother! it helped a lot.
Thank you so much for this playlist sir 🙏🏻🫂❤️
Much needed playlist
btw which app do you use for notes ?? what is the name of this app ??♥♥♥
Bro do more videos based on these kind of approaches bro
Can someone please explain that in optimised solution,when sum is 16 it is still >14 so how did we move r since condition for r is if(sum
Sir a small doubt , for (i=0 --> n-1) doe this mean for(i=0;i
108k views and just 3.4k likes
why people don't appreciate the creator. Always give it a like when you learned something from the video
NICE SUPER EXCELLENT MOTIVATED
Thanks for Sharing bhaiya !! Stack ka v upload kar divine !! ❤️🫠
Hey striver great video as usual.
I wanted to ask about the update on intern position that you posted on linkedin. Have you started to review the assignments ?
Thank you Sir! There was no playlist or videos regarding two pointers or sliding window on TH-cam. Leetcode daily is asking problems related to it currently, would prove to be of great help.
Check aditya verma sliding window playlist too bro
Finnally wait is over 😊
Those who agree we need strings playlist.
Yessssss
8:00 sort karke we can apply two pointer approach right ? As in 3sum and 4sum problems
But fir wohi hai, array needs to be sorted
Striver pls make string playlist 🥺
UNDERSTOOD BHAIYA!!
Can we have playlist on strings. Please
Thanks a lot bro 🙏 ❤️
13:10 does the logic of break works if the arrays contains negative elements ?
One playlist needed for greedy algo too.
1. Sliding window
2. Recursion revision
3. Then I'll move on to hard questions of graph or tree
God is here... Ab koi bhi qn aa jaye sliding window ka contest mei🤝
petition to striver we want string playlist
we a similar small playlist for prefix sum
Revise optimal @30:00
Understood!
Mark for revision
what an explanation 🥵🤯
bro i have a question in returning maximum length of subarray if we return a maxm sum then you break a statment if we got a sum exceed greater then 15 but i have high chance to a another number is a negative number then its sum decrease and we got a longest sub array
Thank you very much sir!!!
Thank you striver ❤, you are our hero
Tnq so much striver bhaiya...
what is the use of maxlen= maxlen(maxlen , j-i+1) at 12:44
Thanks for uploading 🙏
superb bro