Aditya Verma's Graph Playlist: study plan and how long it takes
The Aditya Verma playlist is 56 videos and 22.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.
56 videos · 22.2 hours · Aditya Verma
Aditya Verma's graph playlist covers BFS and DFS, cycle detection, topological sort with Kahn's algorithm, grid problems like number of islands and knight moves, shortest paths with Dijkstra and Bellman-Ford, and disjoint set union with its optimisations.
Many topics have separate theory and code videos, so it's easy to schedule a concept one day and its implementation the next.
Who it's for: Interview candidates who like Aditya Verma's DP teaching style and want the same approach for graphs.
How long does it take?
The full playlist is 22.2 hours across 56 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 | 45 days | 30 days | 23 days |
| 1 h a day | 23 days | 15 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–11 · 5h 5m
Day 1 · 51m
- 11. Graph Introduction and Course Overview | Graph20m
- 22 Types of graphs | Graph31m
Day 2 · 46m
- 33 Graph Implementations | Graph29m
- 44 Graph Implementations | Code | Graph17m
Day 3 · 55m
- 55 Graph Traversal | Graph23m
- 66 Breadth First Search | Graph32m
Day 4 · 35m
- 77 Depth-First Search | Graph35m
Day 5 · 48m
- 88 Find if path exists | Graph28m
- 99 Find if path exists | Code | Graph19m
Day 6 · 38m
- 1010 Steps by Knight | Graph38m
Day 7 · 32m
- 1111 Steps by Knight | Graph | Code32m
Week 2Videos 12–25 · 5h 47m
Day 8 · 53m
- 1212 Reorder routes | Graph31m
- 1313 Cycle Detection | Graph22m
Day 9 · 54m
- 1414 Cycle Detection In Undirected Graph Using DFS | Graph33m
- 1515 Cycle detection In Undirected graph Using BFS | Graph21m
Day 10 · 31m
- 1616 Cycle detection In Directed graph Using DFS | Graph31m
Day 11 · 53m
- 1717 Eventual safe states | Graph37m
- 1818 Eventual safe states Code | Graph17m
Day 12 · 47m
- 1919 Longest Cycle | Graph28m
- 2020 Topological Sort Introduction | Graph18m
Day 13 · 51m
- 2121 Topological Sort Using Kahn’s Algorithm | Graph27m
- 2222 Topological sort using BFS code | Graph24m
Day 14 · 57m
- 2323 TopologicalSort using DFS | Graph24m
- 2424 Course Schedule II | Graph21m
- 2525 Course Schedule II Code | Graph13m
Week 3Videos 26–39 · 5h 16m
Day 15 · 35m
- 2626 Largest Color Value In A Directed Graph | Graph35m
Day 16 · 48m
- 2727 Largest Color Value In A Directed Graph | Code | Graph30m
- 2828 Traversal on grids | Graph18m
Day 17 · 45m
- 2929 Flood Fill | Graph20m
- 3030 Flood Fill Code | Graph25m
Day 18 · 45m
- 3131 Number of Islands | Graph22m
- 3232 Rotten Oranges | Graph22m
Day 19 · 48m
- 3333 Rotten Oranges Code | Graph22m
- 3434 Geeks Village and Wells | Graph26m
Day 20 · 58m
- 3535 Geeks Village and Wells Code | Graph17m
- 3636 Number of operations to make network connected | Graph23m
- 3737 Number of operations to make network connected code | Graph18m
Day 21 · 37m
- 3838 Shortest Path Algorithms | Graph15m
- 3939 Snakes and Ladders | Graph23m
Week 4Videos 40–55 · 5h 26m
Day 22 · 51m
- 4039 Snakes and Ladders Code | Graph30m
- 4241 Dijkstra Algo Intuition and Idea | Graph21m
Day 23 · 51m
- 4342 Dijkstra Analysis and Examples | Graph25m
- 4442 Dijkstra Code | Graph26m
Day 24 · 57m
- 4544 Path With Minimum Effort | Graph23m
- 4645 Path With Minimum Effort Code | Graph12m
- 4746 Cheapest Flight within K Stops | Graph21m
Day 25 · 42m
- 4847 Cheapest Flight within K Stops Code | Graph19m
- 4948 Bellman Ford Algo Part 1 | Graph23m
Day 26 · 39m
- 5049 Bellman Ford Algo Part 2 | Graph28m
- 5150 Bellman Ford Algo Code | Graph11m
Day 27 · 41m
- 5251 Floyd Warshall Algorithm | Graph29m
- 5352 Floyd Warshall Algorithm Code | Graph12m
Day 28 · 44m
- 5453 Disjoint Union Set Introduction | Graph21m
- 5554 DSU Union and find methods | Graph23m
Week 5Videos 56–57 · 39m
Day 29 · 39m
- 5655 DSU Optimzation techniques | Graph23m
- 5756 DSU Code | Graph16m
Tips for finishing
- Pair each theory video with its code video on the same day so the concept is fresh when you implement it.
- One video is unavailable; the planner leaves it out of your schedule automatically.