Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Dynamic Programming Series

By take U forward · English · Advanced

DP on arrays, grids, subsequences, strings, stocks, LIS and partitions.

A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.

What this course covers (57 videos)

  1. Striver's Dynamic Programming Series | The ULTIMATE | The BIGGEST | Teaser #shorts (0:18)
  2. DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques (33:51)
  3. DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations (13:17)
  4. DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP (38:50)
  5. DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question (17:35)
  6. DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences (32:23)
  7. DP 6. House Robber 2 | 1D DP | DP on Subsequences (9:50)
  8. DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP | (52:18)
  9. DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥 (48:29)
  10. DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles (12:59)
  11. DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS (23:47)
  12. DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS (34:39)
  13. DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids (42:38)
  14. DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids (43:23)
  15. DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them (38:49)
  16. DP 15. Partition Equal Subset Sum | DP on Subsequences (9:43)
  17. Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences (29:50)
  18. DP 17. Counts Subsets with Sum K | Dp on Subsequences (36:57)
  19. DP 18. Count Partitions With Given Difference | Dp on Subsequences (18:00)
  20. DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences (41:19)
  21. DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern (34:15)
  22. DP 21. Target Sum | DP on Subsequences (9:04)
  23. DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences (22:17)
  24. DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach (22:54)
  25. DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach (22:54)
  26. Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings (47:09)
  27. DP 26. Print Longest Common Subsequence | Dp on Strings (16:55)
  28. DP 27. Longest Common Substring | DP on Strings 🔥 (14:01)
  29. DP 28. Longest Palindromic Subsequence (9:38)
  30. DP 29. Minimum Insertions to Make String Palindrome (12:00)
  31. DP 30. Minimum Insertions/Deletions to Convert String A to String B (7:30)
  32. DP 31. Shortest Common Supersequence | DP on Strings (26:44)
  33. DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥 (40:15)
  34. DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥 (37:39)
  35. DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥 (43:52)
  36. DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥 (9:11)
  37. DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation (35:34)
  38. DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation (31:50)
  39. DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation (12:24)
  40. DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation (15:21)
  41. DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation (7:20)
  42. DP 41. Longest Increasing Subsequence | Memoization (24:35)
  43. DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm (25:57)
  44. DP 43. Longest Increasing Subsequence | Binary Search | Intuition (16:27)
  45. DP 44. Largest Divisible Subset | Longest Increasing Subsequence (14:39)
  46. DP 45. Longest String Chain | Longest Increasing Subsequence | LIS (16:57)
  47. DP 46. Longest Bitonic Subsequence | LIS (13:52)
  48. DP 47. Number of Longest Increasing Subsequences (20:46)
  49. DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥 (53:41)
  50. DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation (9:08)
  51. DP 50. Minimum Cost to Cut the Stick (30:02)
  52. DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update (34:00)
  53. DP 52. Evaluate Boolean Expression to True | Partition DP (34:55)
  54. DP 53. Palindrome Partitioning - II | Front Partition 🔥 (23:17)
  55. DP 54. Partition Array for Maximum Sum | Front Partition 🔥 (21:39)
  56. DP 55. Maximum Rectangle Area with all 1's | DP on Rectangles (11:04)
  57. DP 56. Count Square Submatrices with All Ones | DP on Rectangles 🔥 (15:59)

More DSA courses