Embark on a comprehensive journey to master Dynamic Programming, guided by Striver's highly acclaimed series. This learning path covers fundamental concepts like memoization and tabulation, progresses through 1D, 2D, and 3D DP problems, explores advanced techniques for subsequences, strings, stocks, and culminates in complex partition DP and rectangle-based problems. Perfect for competitive programmers and anyone aiming to excel in algorithmic problem-solving.
DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |
52:18
DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥
48:29
DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles
12:59
DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS
23:47
DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS
34:39
DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids
42:38
DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids
43:23
Quiz: Module 2: 2D DP & DP on Grids
10 min
DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them
38:49
DP 15. Partition Equal Subset Sum | DP on Subsequences
9:43
Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences
29:50
DP 17. Counts Subsets with Sum K | Dp on Subsequences
36:57
DP 18. Count Partitions With Given Difference | Dp on Subsequences
18:00
DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences
41:19
DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern
34:15
DP 21. Target Sum | DP on Subsequences
9:04
DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences
22:17
DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach
22:54
DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach
22:54
Quiz: Module 3: DP on Subsequences (Subset Sum, Knapsack & Variations)
10 min
Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings
47:09
DP 26. Print Longest Common Subsequence | Dp on Strings
16:55
DP 27. Longest Common Substring | DP on Strings 🔥
14:01
DP 28. Longest Palindromic Subsequence
9:38
DP 29. Minimum Insertions to Make String Palindrome
12:00
DP 30. Minimum Insertions/Deletions to Convert String A to String B
7:30
DP 31. Shortest Common Supersequence | DP on Strings
26:44
DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥
40:15
DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥
37:39
DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥
43:52
Quiz: Module 4: DP on Strings (LCS & Variations)
10 min
DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥
9:11
DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation
35:34
DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation
31:50
DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation
12:24
DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation
15:21
DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation
7:20
Quiz: Module 5: DP on Stocks
10 min
DP 41. Longest Increasing Subsequence | Memoization
24:35
DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm
25:57
DP 43. Longest Increasing Subsequence | Binary Search | Intuition
16:27
DP 44. Largest Divisible Subset | Longest Increasing Subsequence
14:39
DP 45. Longest String Chain | Longest Increasing Subsequence | LIS
16:57
DP 46. Longest Bitonic Subsequence | LIS
13:52
DP 47. Number of Longest Increasing Subsequences
20:46
Quiz: Module 6: Longest Increasing Subsequence (LIS & Variations)
10 min
DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥
53:41
DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation
9:08
DP 50. Minimum Cost to Cut the Stick
30:02
DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update
34:00
DP 52. Evaluate Boolean Expression to True | Partition DP
34:55
DP 53. Palindrome Partitioning - II | Front Partition 🔥
23:17
DP 54. Partition Array for Maximum Sum | Front Partition 🔥
21:39
Quiz: Module 7: Partition DP & Advanced Problems
10 min