L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns
Vložit
- čas přidán 25. 03. 2024
- Notes/Codes/Problem links under step 10 of A2Z DSA Course: takeuforward.org/strivers-a2z...
Entire playlist: • Two Pointer and Slidin...
Follow us on our other social media handles: linktr.ee/takeuforward
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.
Petition to Striver - We want string playlist ASAP!!
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])
gurudev aaj ka leetcode daily dekh ke socha tha, striver ka sliding window kab aayega. aur aapne sun bhi li 😌
Despite your busy schedule, you still manage to deliver invaluable content like this. I salute you, sir! Thank you very much for the teachings.
Petition to striver: we want string playlist
Most awaited playlist🎉🎉🎉
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!
Striver bro---we want string palylist
This is something I was wishing 2 days back. Thanks Bhaiya :)
Best intro of any series on CZcams 🎉
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!!
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 🙏🙏
VOTE FOR STRING PLAYLIST
Thumbnail upgrade crazyyy…thanx for your efforts….eagerly waiting for strings
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.
Most awaited series
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!!
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.
Was waiting for this playlist from a long time. Thank u so much sir
Today i was thinking when will striver be teaching Sliding Window nd here it comes 🎉
King is back with DSA..
Awesome Bro! Great teaching skills!
you are doing great work striver
Hey man, was waiting for this playlist for a long time. Appreciate your efforts
My motivation to continue grinding.
Please upload greedy and heaps playlist too #striver
Greedy is coming next weekend
Completed this amazing Video. Going to Blitz through every question/video now😈
💯 / 10 teacher for dsa..
Thank you so much ❤bhaiya apki sari videos kaffi helpful rahi hai hamare liye
Tnq so much striver bhaiya...
thanks for your dedication !
Man ! you are amazing.
Thanks for uploading 🙏
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
bro striver i am so grateful for all you do ...but please a simple request on the heaps and string playlist🙏
Optimization was so great 🥵 I never thought about improving 2n to n
Thank You for the efforts
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
Petition to Striver: We want playlists on Strings & Prefix Sum logic, heap & updated playlist on hashing
It is important to note that Pattern 2 is applicable for positive numbers only. In your case itself if the array was [2,5,1,7,-5,10] instead of [2,5,1,7,10] your solution would be wrong.
can you explain how ?
@@prasannasahoo0806 sure.
During the execution when L is at position 0 and R is at position 3, the subarray 2,5,1,7 gives the sum 15 which is greater than 14 so L will move to position 1. The new sub array now is 5,1,7.
Then R moves to position 4 but L does not move back to position 0. So, the subarray 2,1,5,7,-5 which is a valid array but it is not checked in this method.
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?
Striver is god !!
Thank you sir !!
Thank you so much for this playlist sir 🙏🏻🫂❤️
great work sir🙌
Thanks a lot bhaiya 💙
Finnally wait is over 😊
NICE SUPER EXCELLENT MOTIVATED
Thanks a lot bro 🙏 ❤️
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
Really Helpful!
guru dev dhanyawad🙏
wow finally 😍 . Thanks
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
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 .
Today i was thinking when will striver be teaching Sliding Window nd here it comes (2)
Thanks for Sharing bhaiya !! Stack ka v upload kar divine !! ❤️🫠
Thank u very much bhaiya
Thank you very much
awesome ❤
Thank you striver ❤, you are our hero
bhaiya aaj ke contest me first time 3 question hua 🙂🙂🙂🙂because of you thank you
Thanks a lot🙂
One playlist needed for greedy algo too.
Thanks. Understood
understood bhaiya
superb bro
Thank You
Thank you bhaiya
Samaj aa gaya.
thanks Raj
Was in waiting ✋️ list for this from a long time ⏲️.
Thanks❤
this content is invaluable! can't thank you enough
Those who agree we need strings playlist.
Yessssss
Striver pls make string playlist 🥺
Great
we a similar small playlist for prefix sum
Much needed playlist
btw which app do you use for notes ?? what is the name of this app ??♥♥♥
Done Sir😎
Can we have playlist on strings. Please
simplest way to learn
For else if(sum > k) break;
There may be negative elements in array right?
Nice
Thank you Sir! There was no playlist or videos regarding two pointers or sliding window on CZcams. Leetcode daily is asking problems related to it currently, would prove to be of great help.
Check aditya verma sliding window playlist too bro
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 ?
Request to striver. We want strings playlists
Revise optimal @30:00
Understood!
Mark for revision
Understood.
completed
string algorithms ,suffix arrays
LETS GOO...
Could you please add additional problems where instead of sum, product of subarrays pattern is taken.
For the 3rd type where you find the number of subarrays satisfying the condition, can’t we just add an extra variable and check if the subarray is satisfying the equal condition and then increase the variable’s value accordingly. Like for example can’t we just include a variable called sub_array_count and then add 1 to it whenever sum = k inside the loop itself?
❤️
petition to striver we want string playlist
God is here... Ab koi bhi qn aa jaye sliding window ka contest mei🤝
I have a small doubt in the 2nd pattern's better approach, shouldn't we also check for l
Yes, at the end we can put a condition if r less than l mean r equal to l plus one
consistency 100
Will these work even if array consist of negative numbers?