L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns

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...

[@vect0r678]

Petition to Striver - We want string playlist ASAP!!

[@JerickMamuric]

Despite your busy schedule, you still manage to deliver invaluable content like this. I salute you, sir! Thank you very much for the teachings.

[@varun1017]

Petition to Striver. We want strings.

[@AJAYKUMARRAJPUT-gl4tm]

I'm also waiting for it

[@mr.rexalan5576]

yes we want strings

[@insidious_681]

Yes striver sir 🙌

[@FilmLover65]

yes we want strings

[@ShivaaySingh20]

Yes , please make series on strings.

[@rajatraj4297]

gurudev aaj ka leetcode daily dekh ke socha tha, striver ka sliding window kab aayega. aur aapne sun bhi li 😌

[@suryasaipalthi]

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!

[@angeldeveloper]

Most awaited playlist🎉🎉🎉

[@uditpanjiyar3203]

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 🙏🙏

[@mansimishra7089]

This is something I was wishing 2 days back. Thanks Bhaiya :)

[@starringharsh]

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])

[@antor.morsalin]

while optimizing, you kinda have to expect the input that is the most time consuming.

[@InWonderland-z2l]

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

[@arnav7050]

Thumbnail upgrade crazyyy…thanx for your efforts….eagerly waiting for strings

[@tasneemayham974]

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!!

[@sanskargupta2739]

Petition to striver: we want string playlist

[@omkarshendge5438]

we do it while(r

[@Arsun-77]

in his terms he is conveying us as upto n-1 which is similar to r

[@NavakanthNani-dz8ge]

in better approch, he is applying while(rk), you can put as while(sum>k && l

[@tanvirahammed3783]

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.

[@nefarious001]

VOTE FOR STRING PLAYLIST

[@kunalwadhai777]

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.

[@thaman701]

Striver bro---we want string palylist

[@vishwaskalra8773]

Today i was thinking when will striver be teaching Sliding Window nd here it comes 🎉

[@xavier4107]

Petition to Striver: We want playlists on Strings & Prefix Sum logic, heap & updated playlist on hashing

[@DhruvBhavinJethva]

Amazing explanation, but one input from my side would be that before updating the window, we should check if(l

[@prasannasahoo0806]

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 .

[@ippilisaisugandhasri9952]

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 .

[@RohitRaj-n7j]

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

[@aishwaryaanand5650]

At 21:55, isn’t it important for the while loop to have one more condition i.e l

[@Braveuser-x7j]

King is back with DSA..

[@abhay3545]

Best intro of any series on KZbin 🎉

[@omkharade9521]

My motivation to continue grinding.

[@affanahammed6742]

Strings and Heaps playlist much needed

[@srishtipandey6068]

Please upload greedy and heaps playlist too #striver

[@KartikeyTT]

Greedy is coming next weekend

[@sejalpawar7076]

Best video I have watched for Sliding window till date

[@shwetanshusinha2690]

Was waiting for this playlist from a long time. Thank u so much sir

[@ropurifiedwater]

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!!

[@ibrahimlanre4285]

bro striver i am so grateful for all you do ...but please a simple request on the heaps and string playlist🙏

[@Cool96267]

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?

[@atulwadhwa192]

Most awaited series

[@harshvardhansankpal716]

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

[@priyanshugagiya]

Optimization was so great 🥵 I never thought about improving 2n to n

[@AyushPetwal-b3i]

💯 / 10 teacher for dsa..

[@dambar67]

Thanks for nice explanation.2nd pattern will not work for negative number right

[@franciskp9117]

Hey man, was waiting for this playlist for a long time. Appreciate your efforts

[@dracoadi6239]

best concept explanation so far

[@cryptojeetu7599]

Best video on sliding window

[@thestarters9799]

For else if(sum > k) break; There may be negative elements in array right?

[@debadityaghosh7612]

what an explanation man!!!! Hats off🤩

[@deepaksingh3533]

Hi Striver! I completed my master’s in mathematics in 2022 and have been working at **** using Java. I've been studying data structures and algorithms (DSA) for the past 4-5 months, but I'm struggling to follow a step-by-step approach. Can you suggest where I should start and how I can effectively tackle DSA problems?

[@as_if]

1. Sliding window 2. Recursion revision 3. Then I'll move on to hard questions of graph or tree

[@blitztour5924]

Completed this amazing Video. Going to Blitz through every question/video now😈

[@sahil_bagde]

Starting me thoda problem hoga , but fir ek do baar dekhne pr samaz jata hai 😀

[@a_13_balaji_k44]

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

[@sultan_3006]

I was also wondering why no one has commented on that part!

[@prasannasahoo0806]

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

[@purushottam108]

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

[@rahulmahajan2412]

basically we get that subarray sum in that iteration only. So no need to iterate the last element

[@harshhpreet]

@@purushottam108 hey, why did you write while(r

[@shahriaralom2903]

Today i was thinking when will striver be teaching Sliding Window nd here it comes (2)

[@fangirltalent5402]

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

[@starringharsh]

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.

[@prasannasahoo0806]

can you explain how ?

[@starringharsh]

@@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.

[@rishabhnema2479]

One playlist needed for greedy algo too.

[@monikayadav-wb6pu]

Thank you so much ❤bhaiya apki sari videos kaffi helpful rahi hai hamare liye

[@AlvinOctaviano-k1m]

Very good explanation

[@ParthKamal-iy9bf]

you are doing great work striver

[@rizmaaggarwal3389]

very good work. thanks alot for doing this.

[@anujkapri6054]

Can we have playlist on strings. Please

[@aishwarya156]

Awesome Bro! Great teaching skills!

[@rishabhnema2479]

Thank you Sir! There was no playlist or videos regarding two pointers or sliding window on KZbin. Leetcode daily is asking problems related to it currently, would prove to be of great help.

[@ankittjindal]

Check aditya verma sliding window playlist too bro

[@saibhanu4142]

Sir a small doubt , for (i=0 --> n-1) doe this mean for(i=0;i

[@NikhilKumar-xg7re]

Much needed playlist btw which app do you use for notes ?? what is the name of this app ??♥♥♥

[@rishabhnema2479]

Could you please add additional problems where instead of sum, product of subarrays pattern is taken.

[@hashcodez757]

UNDERSTOOD BHAIYA!!

[@hawkop2386]

Bro do more videos based on these kind of approaches bro

[@UECAshutoshKumar]

Thank you

[@Biradar_Ganesh]

Thank you so much for this playlist sir 🙏🏻🫂❤️

[@tier3wala]

Thanks for Sharing bhaiya !! Stack ka v upload kar divine !! ❤️🫠

[@kashafkhan9726]

Was in waiting ✋️ list for this from a long time ⏲️.

[@omniamahmoud6604]

Amazing video 👏

[@RitikRaj-we2sc]

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 ?

[@dipendrasingh4874]

bhaiya aaj ke contest me first time 3 question hua 🙂🙂🙂🙂because of you thank you

[@prayasjain8104]

New to DSA, Want to understand for 2nd pattern Longest subarray where sum

[@marsymoyhailu9083]

the video was very nice but in the better solution when only one element is higher than 14 the left pointer moves on and passes the right one

[@Arya20012]

Thank you striver ❤, you are our hero

[@shivanshmahajan2281]

Finnally wait is over 😊

[@survivourff7014]

Tnq so much striver bhaiya...

[@newbie8051]

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

[@Chai_parathe]

Striver pls make string playlist 🥺

[@whamjampamham]

Those who agree we need strings playlist.

[@eesnehhil]

Yessssss

[@nayeemrafsan356]

this content is invaluable! can't thank you enough

[@akashsoam7581]

we a similar small playlist for prefix sum

[@aniketrangari8679]

simplest way to learn

[@abhinavnarula7300]

I have a small doubt in the 2nd pattern's better approach, shouldn't we also check for l

[@AjithKumaR-jw9wt]

Yes, at the end we can put a condition if r less than l mean r equal to l plus one

[@Lakshya-f4l]

Revise optimal @30:00 Understood! Mark for revision

[@hat_awesome21]

Thanks a lot bro 🙏 ❤️

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@t-anime517]

guru dev dhanyawad🙏

[@manikantareddy9454]

great work sir🙌

[@SanjeevM-yc5uj]

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?

[@CodeWithCuriosity]

what an explanation 🥵🤯

[@kanishkbairagi409]

Request to striver. We want strings playlists

[@adityamaheshwari4250]

Kya phaddu video h bhai!

[@subee128]

Thank you very much

[@priyan8004]

Man ! you are amazing.

[@devshubham5528]

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

[@LinhHoang-ml1qo]

thanks for your dedication !

[@ritikanand3425]

Thank You for the efforts

[@KaranSingh-v7t3y]

Thanks for uploading 🙏

[@rajsharmawatch]

petition to striver we want string playlist

[@torishi82]

Samaj aa gaya.

[@jacobblack2544]

Thanks striver chachu