Aditya Verma's Recursion Playlist: study plan and how long it takes
The Aditya Verma playlist is 19 videos and 6.6 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.
19 videos · 6.6 hours · Aditya Verma
Aditya Verma's recursion playlist teaches a method rather than a list of problems: think in terms of hypothesis, induction and base condition, or draw the input-output recursion tree. It applies the method to sorting arrays and stacks, Tower of Hanoi, subsets, permutations, balanced parentheses and the Josephus problem.
It's under seven hours and works well as a lead-in to his DP playlist.
Who it's for: Anyone who can follow a recursive solution but can't write one on their own.
How long does it take?
The full playlist is 6.6 hours across 19 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 | 14 days | 9 days | 7 days |
| 1 h a day | 7 days | 5 days | 4 days |
| 2 h a day | 4 days | 3 days | 2 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 30 minutes 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–10 · 2h 59m
Day 1 · 33m
- 1Recursion Introduction and Identification33m
Day 2 · 29m
- 2Recursion is Everywhere !!9m
- 3Hypothesis-Induction-Base Condition20m
Day 3 · 18m
- 4Beauty of Hypothesis And Induction7m
- 5Height of a Binary Tree11m
Day 4 · 32m
- 6Sort An array using Recursion32m
Day 5 · 29m
- 7Sort A Stack13m
- 8Delete Middle Element of a Stack17m
Day 6 · 15m
- 9Reverse a Stack using Recursion15m
Day 7 · 24m
- 10Kth Symbol in Grammar24m
Week 2Videos 11–18 · 3h 1m
Day 8 · 24m
- 11Tower of Hanoi | Recursion24m
Day 9 · 16m
- 12Print Subsets | Print PowerSets | Print all Subsequences16m
Day 10 · 25m
- 13Print unique subsets And Variations25m
Day 11 · 21m
- 14Permutation with spaces21m
Day 12 · 28m
- 15Permutation with Case Change | Recursion11m
- 16Letter Case Permutation | Recursion17m
Day 13 · 34m
- 17Generate all Balanced Parentheses34m
Day 14 · 33m
- 18Print N-bit binary numbers having more 1’s than 0’s for any prefix33m
Week 3Video 19 · 34m
Day 15 · 34m
- 19Josephus Problem | Game of Death in a circle | Execution in Circle34m
Tips for finishing
- Pause after each problem statement and try the hypothesis-induction-base approach yourself before watching.
- Watch this before the DP playlist; the DP videos assume you can write the recursive version first.