Striver's Dynamic Programming Series: study plan and how long it takes
The take U forward playlist is 57 videos and 23.7 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
57 videos · 23.7 hours · take U forward
Striver's DP series teaches dynamic programming the way it is asked in interviews: write the recursion, add memoization, convert to tabulation, then optimise space. It covers 1D and 2D DP, subsequences and knapsack, DP on strings, the buy-and-sell-stock family, LIS, partition DP and DP on squares.
The 56 numbered problems are grouped by pattern, so finishing one group before moving on matters more than speed.
Who it's for: Interview candidates who are comfortable with recursion and want a structured, pattern-by-pattern DP course.
How long does it take?
The full playlist is 23.7 hours across 57 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 48 days | 32 days | 24 days |
| 1 h a day | 24 days | 16 days | 12 days |
| 2 h a day | 12 days | 8 days | 6 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 5 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–12 · 5h 18m
Day 1 · 47m
- 1Striver's Dynamic Programming Series | The ULTIMATE | The BIGGEST | Teaser #shorts1m
- 2DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques34m
- 3DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations13m
Day 2 · 56m
- 4DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP39m
- 5DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question18m
Day 3 · 42m
- 6DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences32m
- 7DP 6. House Robber 2 | 1D DP | DP on Subsequences10m
Day 4 · 52m
- 8DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |52m
Day 5 · 48m
- 9DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥48m
Day 6 · 37m
- 10DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles13m
- 11DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS24m
Day 7 · 35m
- 12DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS35m
Week 2Videos 13–22 · 5h 4m
Day 8 · 43m
- 13DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids43m
Day 9 · 43m
- 14DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids43m
Day 10 · 49m
- 15DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them39m
- 16DP 15. Partition Equal Subset Sum | DP on Subsequences10m
Day 11 · 30m
- 17Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences30m
Day 12 · 55m
- 18DP 17. Counts Subsets with Sum K | Dp on Subsequences37m
- 19DP 18. Count Partitions With Given Difference | Dp on Subsequences18m
Day 13 · 41m
- 20DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences41m
Day 14 · 43m
- 21DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern34m
- 22DP 21. Target Sum | DP on Subsequences9m
Week 3Videos 23–34 · 4h 40m
Day 15 · 45m
- 23DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences22m
- 24DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach23m
Day 16 · 23m
- 25DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach23m
Day 17 · 47m
- 26Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings47m
Day 18 · 53m
- 27DP 26. Print Longest Common Subsequence | Dp on Strings17m
- 28DP 27. Longest Common Substring | DP on Strings 🔥14m
- 29DP 28. Longest Palindromic Subsequence10m
- 30DP 29. Minimum Insertions to Make String Palindrome12m
Day 19 · 34m
- 31DP 30. Minimum Insertions/Deletions to Convert String A to String B8m
- 32DP 31. Shortest Common Supersequence | DP on Strings27m
Day 20 · 40m
- 33DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥40m
Day 21 · 38m
- 34DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥38m
Week 4Videos 35–49 · 5h 42m
Day 22 · 53m
- 35DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥44m
- 36DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥9m
Day 23 · 36m
- 37DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation36m
Day 24 · 1h
- 38DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation32m
- 39DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation12m
- 40DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation15m
Day 25 · 58m
- 41DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation7m
- 42DP 41. Longest Increasing Subsequence | Memoization25m
- 43DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm26m
Day 26 · 48m
- 44DP 43. Longest Increasing Subsequence | Binary Search | Intuition16m
- 45DP 44. Largest Divisible Subset | Longest Increasing Subsequence15m
- 46DP 45. Longest String Chain | Longest Increasing Subsequence | LIS17m
Day 27 · 35m
- 47DP 46. Longest Bitonic Subsequence | LIS14m
- 48DP 47. Number of Longest Increasing Subsequences21m
Day 28 · 54m
- 49DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥54m
Week 5Videos 50–57 · 3h
Day 29 · 39m
- 50DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation9m
- 51DP 50. Minimum Cost to Cut the Stick30m
Day 30 · 34m
- 52DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update34m
Day 31 · 58m
- 53DP 52. Evaluate Boolean Expression to True | Partition DP35m
- 54DP 53. Palindrome Partitioning - II | Front Partition 🔥23m
Day 32 · 49m
- 55DP 54. Partition Array for Maximum Sum | Front Partition 🔥22m
- 56DP 55. Maximum Rectangle Area with all 1's | DP on Rectangles11m
- 57DP 56. Count Square Submatrices with All Ones | DP on Rectangles 🔥16m
Tips for finishing
- Try every problem on your own for 20 to 30 minutes before watching. DP only sticks when you've been stuck on it first.
- Plan revision days after each group (grids, subsequences, strings, stocks, LIS, partitions). Re-solving three old problems beats watching three new ones.