Aditya Verma's Dynamic Programming Playlist: study plan and how long it takes
The Aditya Verma playlist is 49 videos and 16.2 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.
49 videos · 16.2 hours · Aditya Verma
Aditya Verma's DP playlist is famous for teaching dynamic programming as a handful of parent problems: 0/1 knapsack, unbounded knapsack, longest common subsequence, matrix chain multiplication and DP on trees. Each new problem is shown as a variation of one of them.
It's taught in Hindi on a whiteboard, and many people credit it with finally making DP make sense.
Who it's for: Interview candidates who have tried DP and found it random; the pattern-first approach is built for them.
How long does it take?
The full playlist is 16.2 hours across 49 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 | 33 days | 22 days | 17 days |
| 1 h a day | 17 days | 11 days | 9 days |
| 2 h a day | 9 days | 6 days | 5 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 3 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–15 · 5h 6m
Day 1 · 49m
- 1Dynamic Programming | Introduction14m
- 22 Types of knapsack14m
- 33 01 Knapsack Recursive21m
Day 2 · 55m
- 44 01Knapsack Memoization14m
- 55 01 Knapsack Top Down DP41m
Day 3 · 52m
- 66 Identification of Knapsack Problems and Introduction6m
- 77 Subset Sum Problem27m
- 8Equal Sum Partition Problem18m
Day 4 · 21m
- 99 Count of Subsets Sum with a Given Sum21m
Day 5 · 47m
- 1010 Minimum Subset Sum Difference47m
Day 6 · 43m
- 1111 Count the number of subset with a given difference17m
- 1212 Target sum9m
- 1313 Unbounded Knapsack17m
Day 7 · 40m
- 1414 Rod Cutting Problem19m
- 1515 Coin change problem: Maximum number of ways21m
Week 2Videos 16–35 · 5h 58m
Day 8 · 1h
- 1616 Coin change problem: Minimum number of coins26m
- 1717 Coin change problem Contd.1m
- 1818 Longest common subsequence Introduction5m
- 1919 Longest common subsequence Recursive28m
Day 9 · 57m
- 2020 Longest common subsequence Memoization31m
- 2121 Longest common subsequence Top down DP26m
Day 10 · 40m
- 2222 Longest Common Substring13m
- 2323 Printing Longest common subsequence27m
Day 11 · 51m
- 2424 Shortest Common SuperSequence23m
- 2525 Minimum Number of Insertion and Deletion to convert String a to String b15m
- 2626 Longest Palindromic Subsequence13m
Day 12 · 58m
- 2828 Minimum number of deletion in a string to make it a palindrome12m
- 2929 Print shortest common Supersequence23m
- 3030 Longest repeating subsequence13m
- 3131 Sequence Pattern Matching10m
Day 13 · 35m
- 3232 Minimum number of insertion in a string to make it a palindrome13m
- 3333 Matrix chain multiplication Introduction Identification and General Format22m
Day 14 · 57m
- 3434 Matrix Chain Multiplication Recursive41m
- 3535 Matrix chain multiplication Memoization16m
Week 3Videos 36–50 · 5h 6m
Day 15 · 56m
- 3636 Palindrome Partitioning Recursive27m
- 3737 Palindrome Partitioning Memoization19m
- 3838 Palindrome Partitioning Memoized Optimisation10m
Day 16 · 40m
- 3939 Evaluate Expression to True Boolean Parenthesization Recursive40m
Day 17 · 28m
- 4040 Evaluate Expression To True Boolean Parenthesization Memoized28m
Day 18 · 46m
- 4141 Scrambled String Recursive46m
Day 19 · 50m
- 4242 Scrambled String Memoized19m
- 4343 Egg Dropping Problem Recursive30m
Day 20 · 48m
- 4444 Egg Dropping Problem Memoization16m
- 4545 Egg Dropping Problem Memoization Optimization8m
- 4646 Dynamic programming on Trees Introduction and Identification9m
- 4747 Dynamic Programming on Tree General Syntax16m
Day 21 · 39m
- 4848 Diameter of a Binary Tree15m
- 4949 Maximum Path Sum | From any node to any node12m
- 5050 Maximum Path sum | From leaf node to leaf node12m
Tips for finishing
- After each parent problem, list its variations from memory before watching them. That's the skill the playlist teaches.
- One video in the playlist is unavailable; the planner skips it automatically.