Thanks for watching guys! Making this video took a while but it leveled up my editing skills big time 😊 Get a FREE System Design Interview Handbook (75 pages) in your inbox by subscribing to my free newsletter: blog.algomaster.io/
You have solved 1583 problems on leetcode, that's great. But even greater is that by making this one video you are solving millions of DSA learners problem.
Prefix Sum 303. Range Sum Query - Immutable 525. Contiguous Array 560. Subarray Sum Equals K Two Pointers 167. Two Sum II - Input Array is Sorted 15. 3 Sum 11. Container with most water Sliding Window 643. Maximum Average Subarray I 3. Longest Substring without Repeating Characters 76. Minimum Window Substring Fast and Slow Pointers 141. Linked List Cycle 202. Happy Number 287. Find the Duplicate Number Linked List in-place reversal 206. Reverse Linked List 92. Reverse Linked List II 24. Swap Nodes in Pairs Monotonic Stack 496. Next Greater Element I 739. Daily Temperatures 84. Largest Rectangle in Histogram Top K. Elements OR min/max Heap 215. Kth Largest element in an array 347. Top K Frequent Elements 373. Find K Pairs with Smallest Sums Overlapping Intervals 56. Merge Intervals 57. Insert Interval 435. Non-overlapping intervals Modified Binary Search 33. Search in Rotated Sorted Array 153. Find Minimum in Rotated Sorted Array 240. Search a 2D Matrix II Binary Tree Traversal 257. Binary Tree Paths 230. Kth Smallest Element in a BST 124. Binary Tree Maximum Path Sum 107. Binary Tree Level Order Traversal II Depth First Search 133. Clone Graph 113. Path Sum II 210. Course Schedule II Breadth First Search 102. Binary Tree Level Order Traversal 994. Rotting Oranges 127. Word Ladder Matrix Traversal 733. Flood Fill 200. Number of Islands 130. Surrounded Regions Backtracking 46. Permutations 78. Subsets 51. N-Queens Dynamic Programming 70. Climbing Stairs 322. Coin Change 300. Longest Increasing Subsequence 416. Partition Equal Subset Sum 312. Burst Balloons 1143. Longest Common Subsequence
Bro singlehandedly busted the entire DSA ED-Tech community, by just providing the most asked and important patterns to practice before an interview, wow, thanks Ashish
As a beginner programmer, while I did not understand everything, I was particularly amazed at how simple you explained what a sliding window was: subtracting the left and adding the right. Just that sentence made me completely understand it and I felt like I fully unlocked another tool to my algorithm arsenal. Thanks so much!!!
Thanks for sharing. I had an interview at Uber Brazil. Since I had no DSA training, I didn't do well. But now I'm learning a lot from your videos. I'm improving a lot with these tips.
@@kalogs13 Cara se for Software Engineer 2(L4) a que eu fiz. Cara é DSA, tipo leet code. Como eu não tinha pratica não fui bem. O que eu tirei de lição é que o cara tem de ter praticado muito. Um exercício era de topological sort . Não sei teu nível de experiência com DSA. Se não me engano foram 4 questões. Boa sorte mano. Na entrevista com recruiter eu fui bem ela me fez acho 4 perguntas eu respondi na mosca, testou meu ingles e perguntou a complexidade de dois algoritmos e o porque da complexidade. Uber parece ser uma empresa top, gostaria de passar la.
@@jonatasjcgrendering8436 o meu é l3, mas também não tenho muita prática com esse tipo de exercício, não tô expectativa alta. Mas só de ser procurado pela vaga e passar pro código já fiquei feliz kkkkkkk, agora é praticar
Let me be honest. The content here is super underrated on TH-cam. I saw this late and realised so many of such patterns were asked to me in my interviews which I failed to crack. MMT, Walmart etc. Terrific content.
i have seen so many suggestion videos, i felt some lagging feeling with many. this is the first time i am commenting for a dsa youtuber. i just want you to be happy in your life. you choose to share your knowledge and you did it in a very good efficient way. cant be not grateful. thank you so much sir.
Questions (Leetcode) 1:21 - Prefix Sums 2:03 - Two Pointers 2:48 - Sliding Window 3:36 - Fast and Slow Pointers 4:33 - In-place reversal 5:23 - Monotonic Stack Pattern 6:30 - Top k elements (for k largest - min Heap ; for k smallest - max Heap) 7:23 - Overlapping intervals 7:59 - Modified Binary Search Pattern 8:50 - Use case of each binary tree traversal and example 9:27 - DFS of Graph 10:08 - BFS of Graph 11:01 - Matrix Traversal 11:49 - Backtracking 12:21 - DP Patterns and examples
after watching this video i am quite confident i am on right path i too see these patterns frequently and for most of the problems you just you one of these approaches or logic if you notice it while solving your questions.
Yes we expect videos for all the 15 patterns you are a life saver untill now I thought like how much I need to learn for competitive programing but after this video I am sure I can easily crack those competitive programing contests
This is one of the we'll structure video I ever watched. Great content. Literally I watch videos at 1.5x but this one at 0.75x. Cuddos to your efforts.
A good refresher before interviews, but missed adding few more specific graph algos/techniques like (DSU,Topological Sort,Floyd,etc) . Even thought not widely asked , A special mention of distinctive algos like KMP, Manachers algo,Rabin Karp,Knapsack would be a nice addition to make it wholesome. Prolly a part 2 would do that!
This is an amazing video with explanation + visual representation + base code + top 3 problems to practice !! Please do videos on each pattern, It will make our coding journey lot more easier ! Once again thank you so much for the great content !!!
This was great. Thankyou Sir. Please make detailed video on each pattern and also include more Easy, Medium, Hard Practice Problems for each pattern if possible. That will be a great. And Thankyou again for sharing your valuable experience with us.
Amazing video! If you could make a video for each of the pattern, that would be awesome. I'm sure people would love those videos. I know I will. Thanks again!
Hi @ashishps_1, thanks for this video! I remember commenting on one of your videos about DSA question patterns, and today you released this video. Thanks a lot!
Thank you so much! I had a major misunderstanding in my coding approach, but this clarification has really helped. I believe it will be instrumental in solving many of my coding challenges.
Hey Ashish, thanks a ton for making this video. It's made learning LC so much easier and more organized. You're doing a great service to the coding community. Keep up the good work, buddy!
Prifix sum Two pointers Sliding window Fast and slow pointers Linkedin list in-place reversal Monotonic stack Top K elements Overlapping intervals Modified Binary Search Binary tree traversal Depth first search (DFS) Breadth first search (BFS) Matrix traversal Backtracking Dynamic Programming
Thanks a lot for such awesome content. This is the best way to approach leetcode I have found so far. This helped me a lot in preparing for interviews.
You just saved by time and remove my confusion about dsa question solving. You explained presicely about every topics. I want the videos on every topics individually with some examples questions. I really loved it.😊😊
Incredible job. Thank you for doing this. I'm prepping for an interview with Meta, Apple, and Anduril and this is a huge help. So glad the algorithm gods brought us together lol 😅
Thanks a lot for making this nice recap of most commonly used patterns. Also requesting you make another video for 20 Dynamic Programming Patterns like this.
I have watched many videos on DSA patterns but this is the best video i have watched till now. I really appreciate your efforts to make this video and sharing your knowledge will help a lot of people who are genuinely looking for DSA. Stay happy and be healthy 🎉. Thanks a ton BRO 😊
You have provided very good points, but I felft your pace was high, if you could explain each patterns with more details and examples it would be helpful . 😊
Yes I felt the same. May be you don’t need to be confined with the duration as long as the content and pace was intact ! ❤🎉 thanks for sharing your knowledge and expertise
Correction to be made in the subarray sum (single query) code: def find_subarray_sum(array, i, j): subarray_sum = 0 for k in range(i, j + 1): subarray_sum += array[k] return subarray_sum Accumulate array[k] in subarray_sum, not array[i] which will give a different result. Just leaving this comment if there's any confusion.
This video should have been created 4yrs ago. aha! This is the best hack I have seen on the internet. I am just watching it and about to tackle those problems strategically.
Wonderful video. I think this is one of the first videos on Problem Solving patterns in a very good and efficient way. Thank you for the information ! Looking forward to see more number of practice problems for each pattern. Great work. Keep going !!
Infact this is a secret that even I found it after spending years of clutter in TH-cam after coming to US .. I wish I would have good video editing skills well presented Asish, thanks for sharing
🎯 Key points for quick navigation: 00:00 *Solving LeetCode problems effectively is more about recognizing patterns rather than the number of problems solved.* 00:15 *The 15 patterns discussed in the video are crucial for coding interviews at major tech companies like Amazon and Google.* 00:29 *The Prefix Sum pattern optimizes multiple subarray sum queries from O(n*m) to O(1).* 01:24 *The Two Pointers pattern reduces time complexity by moving pointers toward or away from each other for problems like palindrome checking.* 02:06 *The Sliding Window pattern optimizes subarray problems by maintaining a window that slides across the array, reducing time complexity.* 02:48 *The Fast and Slow Pointers pattern helps detect cycles in linked lists or find the middle of a list in one pass.* 03:44 *The Linked List In-Place Reversal pattern rearranges linked list nodes without extra space by using three pointers.* 04:42 *The Monotonic Stack pattern finds the next greater or smaller element in O(n) time, using a stack.* 05:26 *The Top K Elements pattern efficiently finds K largest/smallest elements using a min/max heap.* 06:37 *The Overlapping Intervals pattern solves problems involving merging or intersecting intervals by sorting and iterating through them.* 07:32 *The Modified Binary Search pattern extends binary search to non-perfectly sorted arrays, such as rotated sorted arrays.* 08:14 *The Binary Tree Traversal pattern includes pre-order, in-order, post-order, and level-order traversal, each used for different problem types.* 08:57 *Depth-First Search (DFS) explores all paths in graphs or trees and is useful for problems involving cycles or connected components.* 09:39 *Breadth-First Search (BFS) traverses graphs level-by-level and is ideal for finding shortest paths or connected components.* 10:21 *Matrix Traversal uses graph techniques like DFS and BFS to explore 2D arrays, with applications like island counting.* 11:05 *Backtracking explores all possible solutions and backtracks when paths are invalid, useful for puzzles like Sudoku.* 12:01 *Dynamic Programming solves optimization problems by breaking them down into subproblems and avoiding redundant work.* Made with HARPA AI
1. Prefix Sum 2. Two Pointers 3. Sliding window 4. Fast & Slow Pointers 5. Linked list in-place reversed 6. Monotonic stack 7. Top k elements 8. Overlapping intervals 9. Modified binary search 10. Binary tree traversal - Preorder, Inorder, PostOrder 11. DFS 12. BFS 13. Matrix traversal 14. Backtracking 15. Dynamic Programming Hit like to be on top...👍
5:10 The stack's top element is a 4, meaning you would expect an update at result[4]. Yet the animation updates result[2]--basically updating in reverse, opposite of the code.
I should've come across this video earlier - would've made my preparation easier. But it's cool. Der aaye, durust aaye. Thanks for the wonderful content!
Thanks for watching guys!
Making this video took a while but it leveled up my editing skills big time 😊
Get a FREE System Design Interview Handbook (75 pages) in your inbox by subscribing to my free newsletter: blog.algomaster.io/
sorry sir, we didnt notice editing skills in the first go, your whole content dominanted 100x. thank you so much.
Please make videos on common patterns in LinkedList, tree and graphs
i need you to detail every pattern with a leetcode example in the form of multiple episodes or series
you deserve respect .
Thanks it was best video I have ever seen in my life
0:33 => Prefix Sum
1:25 => Two Pointer
2:05 => Sliding Window
2:54 => Fast & Slow Pointer
3:39 => Linked List In-Place Reversal
4:36 => Monotonic Stack
5:26 => Top 'k' Elements
6:14 => Quick Select
6:33 => Overlapping Intervals
7:25 => Modified Binary Search
8:56 => Depth-First Search(DFS)
9:32 => Breadth-First Search(BFS)
10:11 => Matrix Traversal
11:04 => Backtracking
11:52 => Dynamic Programming
Thanks
Thanks. How do you collect these timestamps ? Do you see it manually ? or use any script ?
Quick select is not actually discussed, instead there is Binary Tree Traversal at 8:03
Commenting here so i can comeback and check this resource. Wish me luck for my interview preparation :)
Thanks
You have solved 1583 problems on leetcode, that's great. But even greater is that by making this one video you are solving millions of DSA learners problem.
Prefix Sum
303. Range Sum Query - Immutable
525. Contiguous Array
560. Subarray Sum Equals K
Two Pointers
167. Two Sum II - Input Array is Sorted
15. 3 Sum
11. Container with most water
Sliding Window
643. Maximum Average Subarray I
3. Longest Substring without Repeating Characters
76. Minimum Window Substring
Fast and Slow Pointers
141. Linked List Cycle
202. Happy Number
287. Find the Duplicate Number
Linked List in-place reversal
206. Reverse Linked List
92. Reverse Linked List II
24. Swap Nodes in Pairs
Monotonic Stack
496. Next Greater Element I
739. Daily Temperatures
84. Largest Rectangle in Histogram
Top K. Elements OR min/max Heap
215. Kth Largest element in an array
347. Top K Frequent Elements
373. Find K Pairs with Smallest Sums
Overlapping Intervals
56. Merge Intervals
57. Insert Interval
435. Non-overlapping intervals
Modified Binary Search
33. Search in Rotated Sorted Array
153. Find Minimum in Rotated Sorted Array
240. Search a 2D Matrix II
Binary Tree Traversal
257. Binary Tree Paths
230. Kth Smallest Element in a BST
124. Binary Tree Maximum Path Sum
107. Binary Tree Level Order Traversal II
Depth First Search
133. Clone Graph
113. Path Sum II
210. Course Schedule II
Breadth First Search
102. Binary Tree Level Order Traversal
994. Rotting Oranges
127. Word Ladder
Matrix Traversal
733. Flood Fill
200. Number of Islands
130. Surrounded Regions
Backtracking
46. Permutations
78. Subsets
51. N-Queens
Dynamic Programming
70. Climbing Stairs
322. Coin Change
300. Longest Increasing Subsequence
416. Partition Equal Subset Sum
312. Burst Balloons
1143. Longest Common Subsequence
thanks buddy
legend
You have my LIke and my respect...
nice
bruh 😎
You the real MVP
No bs, no gatekeeping, no useless descriptions. Thanks, sir.
Bro singlehandedly busted the entire DSA ED-Tech community, by just providing the most asked and important patterns to practice before an interview, wow, thanks Ashish
Indeed and just in 15 mins 🙏
Ab kya kare, Ashis nam k bande hote he ese h 😌
@marcush3ll673 but he added some more questions patterns
As a beginner programmer, while I did not understand everything, I was particularly amazed at how simple you explained what a sliding window was: subtracting the left and adding the right. Just that sentence made me completely understand it and I felt like I fully unlocked another tool to my algorithm arsenal. Thanks so much!!!
Thanks for sharing. I had an interview at Uber Brazil. Since I had no DSA training, I didn't do well. But now I'm learning a lot from your videos. I'm improving a lot with these tips.
Great to hear that you are finding my videos helpful!
@@ashishps_1bkl body bana jra
Opa maninho, vou fazer essa entrevista tambem, tem alguma dica?
@@kalogs13 Cara se for Software Engineer 2(L4) a que eu fiz. Cara é DSA, tipo leet code. Como eu não tinha pratica não fui bem. O que eu tirei de lição é que o cara tem de ter praticado muito. Um exercício era de topological sort . Não sei teu nível de experiência com DSA. Se não me engano foram 4 questões. Boa sorte mano. Na entrevista com recruiter eu fui bem ela me fez acho 4 perguntas eu respondi na mosca, testou meu ingles e perguntou a complexidade de dois algoritmos e o porque da complexidade. Uber parece ser uma empresa top, gostaria de passar la.
@@jonatasjcgrendering8436 o meu é l3, mas também não tenho muita prática com esse tipo de exercício, não tô expectativa alta. Mas só de ser procurado pela vaga e passar pro código já fiquei feliz kkkkkkk, agora é praticar
You just compressed the crux of leetcode problem-solving techniques down to 13 mins. Well done!
Let me be honest. The content here is super underrated on TH-cam. I saw this late and realised so many of such patterns were asked to me in my interviews which I failed to crack. MMT, Walmart etc. Terrific content.
Let it remain underrated bruh. You know what i mean XD
This is genuinely one of the most useful videos I have found all month.
i have seen so many suggestion videos, i felt some lagging feeling with many. this is the first time i am commenting for a dsa youtuber. i just want you to be happy in your life. you choose to share your knowledge and you did it in a very good efficient way. cant be not grateful. thank you so much sir.
I am so happy to hear this ❤️
Thanks for your kind words and wish you all the best in your journey 👍
Awesome video. Probably the first time I have needed to slow down the video to understand what is going on!
Questions (Leetcode)
1:21 - Prefix Sums
2:03 - Two Pointers
2:48 - Sliding Window
3:36 - Fast and Slow Pointers
4:33 - In-place reversal
5:23 - Monotonic Stack Pattern
6:30 - Top k elements (for k largest - min Heap ; for k smallest - max Heap)
7:23 - Overlapping intervals
7:59 - Modified Binary Search Pattern
8:50 - Use case of each binary tree traversal and example
9:27 - DFS of Graph
10:08 - BFS of Graph
11:01 - Matrix Traversal
11:49 - Backtracking
12:21 - DP Patterns and examples
after watching this video i am quite confident i am on right path i too see these patterns frequently and for most of the problems you just you one of these approaches or logic if you notice it while solving your questions.
please make more detailed vidoes on the following topics . this was really helpfull.
Sure, will do
Please make video on Graph pattern
@@ashishps_1please make videos on graph pattern
@@ashishps_1 please sir do it as soon as possible
Yes we expect videos for all the 15 patterns you are a life saver untill now I thought like how much I need to learn for competitive programing but after this video I am sure I can easily crack those competitive programing contests
This is one of the we'll structure video I ever watched. Great content. Literally I watch videos at 1.5x but this one at 0.75x. Cuddos to your efforts.
Bhai tu to bada jabardast hai, wow amazing. Solved my confusion.
I really love the animations and analogies used in this video. They help to illustrate the concepts in an awesome way!
Bro, your videos are a hidden gem. Keep delivering such videos. They are very helpful.
Love to hear this, thank you 😊
A good refresher before interviews, but missed adding few more specific graph algos/techniques like (DSU,Topological Sort,Floyd,etc) . Even thought not widely asked , A special mention of distinctive algos like KMP, Manachers algo,Rabin Karp,Knapsack would be a nice addition to make it wholesome. Prolly a part 2 would do that!
This is hands down the best recap/summary that I needed to find on LeetCode. Thanks a lot
This is an amazing video with explanation + visual representation + base code + top 3 problems to practice !! Please do videos on each pattern, It will make our coding journey lot more easier !
Once again thank you so much for the great content !!!
This was great. Thankyou Sir. Please make detailed video on each pattern and also include more Easy, Medium, Hard Practice Problems for each pattern if possible. That will be a great. And Thankyou again for sharing your valuable experience with us.
Amazing video! If you could make a video for each of the pattern, that would be awesome. I'm sure people would love those videos. I know I will. Thanks again!
This is a great overview of optimisation code complexity.
This will help to grow your channel.
Hi @ashishps_1, thanks for this video! I remember commenting on one of your videos about DSA question patterns, and today you released this video. Thanks a lot!
That was cool. Fully support deep dives (and longer leetcode lists) for each (including the 20 DP algos linked).
Thank you so much! I had a major misunderstanding in my coding approach, but this clarification has really helped. I believe it will be instrumental in solving many of my coding challenges.
Hey Ashish, thanks a ton for making this video. It's made learning LC so much easier and more organized. You're doing a great service to the coding community. Keep up the good work, buddy!
Thanks a lot. So happy to hear this 😊
its like a homework from you to practice these problems.
wanted this video thanku very much sir
Excellent job summarising. 👏👏👏
This was exactly what iam looking for❤ will be very helpful if u can make an elaborated video on each pattern.
Glad you liked it. I will make detailed video on each pattern
Prifix sum
Two pointers
Sliding window
Fast and slow pointers
Linkedin list in-place reversal
Monotonic stack
Top K elements
Overlapping intervals
Modified Binary Search
Binary tree traversal
Depth first search (DFS)
Breadth first search (BFS)
Matrix traversal
Backtracking
Dynamic Programming
@@ojaskumar2355 Thx
thanks
I would add Greedy and Union Find also
Thanks a lot for such awesome content. This is the best way to approach leetcode I have found so far.
This helped me a lot in preparing for interviews.
You just saved by time and remove my confusion about dsa question solving. You explained presicely about every topics. I want the videos on every topics individually with some examples questions. I really loved it.😊😊
Damm man, one of the best videos to practice for the interview. Just absolutely loved the content ❤
Love to hear this, thank you so much 😊
Man this is gold, i was asked an interval problem for my Hubspot coding assessment and bombed it, now i know
Straight to the point, great video. Thanks
One of the best videos for someone who's gonna start solving leetcode contest 👍👍
Incredible job. Thank you for doing this. I'm prepping for an interview with Meta, Apple, and Anduril and this is a huge help. So glad the algorithm gods brought us together lol 😅
Thanks a lot for making this nice recap of most commonly used patterns.
Also requesting you make another video for 20 Dynamic Programming Patterns like this.
I've been coming back every day and learning 1 a day. I honestly already feel so much less stressed about coding assessments. Thank you so much!
I have watched many videos on DSA patterns but this is the best video i have watched till now. I really appreciate your efforts to make this video and sharing your knowledge will help a lot of people who are genuinely looking for DSA. Stay happy and be healthy 🎉. Thanks a ton BRO 😊
Thank you so much for your kind words. Really happy to hear this 😊
You have revised the entire DSA in just 13 minutes...Great Work !!
🔥🔥Short and crisp Explanation
Please do a series on all these Leetcode patterns and also a DSA series would be helpful. Great explanation in 12 mins by the way.
i can't thank you enough I mean this has to be the most important and helpful for a student new to DSA
You have provided very good points, but I felft your pace was high, if you could explain each patterns with more details and examples it would be helpful . 😊
Sure
Yes I felt the same. May be you don’t need to be confined with the duration as long as the content and pace was intact ! ❤🎉 thanks for sharing your knowledge and expertise
Yes I too felt the same ..why so hurry bro , content is really great but
yes please can you make detailed video for all the patterns
Use chatgpt for that
Extremely well paced video...great content👍👏
Actually he is right, when I started giving Leetcode Competition I also started observing patterns in questions.
This video is gold for DSA learner ❤
Thanks!
Thank you so much 😊
Bro speaking in 2x speed, I literally watched this video in 0.75x
😂
the same here )
No bullshit , clean and clear presentation ! Thanks Brother
Correction to be made in the subarray sum (single query) code:
def find_subarray_sum(array, i, j):
subarray_sum = 0
for k in range(i, j + 1):
subarray_sum += array[k]
return subarray_sum
Accumulate array[k] in subarray_sum, not array[i] which will give a different result.
Just leaving this comment if there's any confusion.
A lot of information summed up effectively. Thank you!
This video should have been created 4yrs ago. aha! This is the best hack I have seen on the internet. I am just watching it and about to tackle those problems strategically.
ekdum kadak, short & crisp
This is the best DSA video so far, can’t believe it was just 13 minutes 😅
Great express brief on various DSA patterns. Hoping you will do videos on each pattern mentioned here. Thanks for the valuable sharing.
Wonderful video. I think this is one of the first videos on Problem Solving patterns in a very good and efficient way. Thank you for the information ! Looking forward to see more number of practice problems for each pattern.
Great work. Keep going !!
Love to hear this, thank you so much!
Infact this is a secret that even I found it after spending years of clutter in TH-cam after coming to US .. I wish I would have good video editing skills well presented Asish, thanks for sharing
Crisp and clear. Thanks Ashish.!
And yes, I would love learn more patterns 👍
Please make more vedios on each pattern.......very useful and thank you for posting such vedios
6:22 Yes Sir, we want detailed video on each of the following patterns.
This video deserves the Tech Gamechanging Video of the Year award
I was struggling for reverse LinkedList problem😅
You explained very well.
Thanks brother keep it up 👍
Very precise and informative video! Thanks Ashish!🎉
Glad you liked it
This video has a lot of knowledge. Please make separate videos on each topic. Thanks in advance 🎉
🎯 Key points for quick navigation:
00:00 *Solving LeetCode problems effectively is more about recognizing patterns rather than the number of problems solved.*
00:15 *The 15 patterns discussed in the video are crucial for coding interviews at major tech companies like Amazon and Google.*
00:29 *The Prefix Sum pattern optimizes multiple subarray sum queries from O(n*m) to O(1).*
01:24 *The Two Pointers pattern reduces time complexity by moving pointers toward or away from each other for problems like palindrome checking.*
02:06 *The Sliding Window pattern optimizes subarray problems by maintaining a window that slides across the array, reducing time complexity.*
02:48 *The Fast and Slow Pointers pattern helps detect cycles in linked lists or find the middle of a list in one pass.*
03:44 *The Linked List In-Place Reversal pattern rearranges linked list nodes without extra space by using three pointers.*
04:42 *The Monotonic Stack pattern finds the next greater or smaller element in O(n) time, using a stack.*
05:26 *The Top K Elements pattern efficiently finds K largest/smallest elements using a min/max heap.*
06:37 *The Overlapping Intervals pattern solves problems involving merging or intersecting intervals by sorting and iterating through them.*
07:32 *The Modified Binary Search pattern extends binary search to non-perfectly sorted arrays, such as rotated sorted arrays.*
08:14 *The Binary Tree Traversal pattern includes pre-order, in-order, post-order, and level-order traversal, each used for different problem types.*
08:57 *Depth-First Search (DFS) explores all paths in graphs or trees and is useful for problems involving cycles or connected components.*
09:39 *Breadth-First Search (BFS) traverses graphs level-by-level and is ideal for finding shortest paths or connected components.*
10:21 *Matrix Traversal uses graph techniques like DFS and BFS to explore 2D arrays, with applications like island counting.*
11:05 *Backtracking explores all possible solutions and backtracks when paths are invalid, useful for puzzles like Sudoku.*
12:01 *Dynamic Programming solves optimization problems by breaking them down into subproblems and avoiding redundant work.*
Made with HARPA AI
0:47, the line in the for loop should be:
subarray_sum += array[k]
Anyway, this is a very helpful video. Thanks!
1. Prefix Sum
2. Two Pointers
3. Sliding window
4. Fast & Slow Pointers
5. Linked list in-place reversed
6. Monotonic stack
7. Top k elements
8. Overlapping intervals
9. Modified binary search
10. Binary tree traversal - Preorder, Inorder, PostOrder
11. DFS
12. BFS
13. Matrix traversal
14. Backtracking
15. Dynamic Programming
Hit like to be on top...👍
)))
I don’t normally thumbs up videos but this one deserves one!
Great content sir, please teach the whole concept 🙏
Really helpful video!! Please make a video covering other main patterns apart from these that are asked frequently
You've hanged all DSA bhaiya/bhabhi channels. Hats off to you brother 😂❤
This was really helpful. Best video explaining all patterns clearly
pls make more detailed videos like this pls you explain everything in a clear way
Solid ! Gold ! Anmol content ❤
The best video that every coder should watch.
Ley me start by appreciating -You are doing a great job here. 🎉 👏👏Yes, please make detailed videos for each.
Great video. Revised all the concepts
Wow! Can't believe I have learned this much from 13 mins!!
Subscribed!
it's crazy to think about the fact you solved 1583 problems. nice work!
Most valuable video I have seen! Thank you so much for your effort
Ashish Pratap Singh in short way all the things u have covered … such a imagining way ❤❤
5:10 The stack's top element is a 4, meaning you would expect an update at result[4]. Yet the animation updates result[2]--basically updating in reverse, opposite of the code.
Really a great video for College students who are eager to upskill there skill in terms of Problem solving . Thanks for this content 👏
great content.. pls make a series for each technique with any language... tks for sharing!
Thank you. Very well summarized !
Keep it up!!!
I should've come across this video earlier - would've made my preparation easier. But it's cool. Der aaye, durust aaye. Thanks for the wonderful content!
Great video we want more this type of video
Yes, more vids for each topic in Python. Thanks!
I found what I want on TH-cam thanks for sharing this video with us 💯
Nice very informative video bro ❤ 4:03 keep sharing
Daamm so precise and crisp thanks a lot man
9:45 great video! But for finding all connected components in graph we should use DFS instead of BFS.
I wish I saw your video earlier. This is woderful. Thanks for sharing!
Great work as usual but this one is another level.Thank you!