Chai aur DSA (Hitesh Choudhary): study plan and how long it takes
The Chai aur Code playlist is 28 videos and 43.0 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.
28 videos · 43.0 hours · Chai aur Code
Chai aur DSA is Hitesh Choudhary's DSA course in Hindi using Python: time complexity, arrays, linked lists, stacks, queues and deques, recursion, trees and BSTs, graphs with BFS and DFS, sorting, divide and conquer, greedy algorithms and an introduction to dynamic programming.
The last two videos are 10-hour compilations of the whole series, which is why the playlist total looks so large.
Who it's for: Python developers and beginners who want to learn DSA in Hindi without switching to C++ or Java.
How long does it take?
The full playlist is 43.0 hours across 28 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 | 87 days | 58 days | 44 days |
| 1 h a day | 44 days | 29 days | 22 days |
| 2 h a day | 22 days | 15 days | 11 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 2 hours 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–12 · 10h 14m
Day 1 · 1h 17m
- 11. Introduction to DSA and Time Complexity in Python1h 17m
Day 2 · 1h 7m
- 22. Array in python | Chai aur DSA1h 7m
Day 3 · 1h 1m
- 34. Doubly Linked List and Circular Linked List | Chai aur DSA1h 1m
Day 4 · 1h 33m
- 43. Singly Linked List in Python | Chai aur DSA1h 2m
- 50. Announcing Chai aur DSA5m
- 65. Stack in Python25m
Day 5 · 1h 38m
- 76. Queue and Deque in Python | Chai aur DSA52m
- 87. Circular Queue in Python46m
Day 6 · 1h 54m
- 98. Recursion in python | Chai aur DSA57m
- 109. Introduction to Tree & Types of tree & Its Representation57m
Day 7 · 1h 45m
- 1110. Tree Traversal | Chai aur DSA44m
- 1211. What is BST , Insertion and Searching in BST1h 1m
Week 2Videos 13–25 · 10h 28m
Day 8 · 1h 49m
- 1312. Deletion in BST1h 2m
- 1413. Graph and Its Matrix Representation in Python47m
Day 9 · 1h 26m
- 1514. Graph Adjacency List Representation40m
- 1615. Graph Traversal DFS46m
Day 10 · 1h 32m
- 1716. BFS Graph Traversal39m
- 1817. Bubble Sort | Chai aur DSA31m
- 1918. Selection Sort22m
Day 11 · 1h 46m
- 2019. Insertion Sort32m
- 2120. Merge Sort | Chai aur DSA1h 14m
Day 12 · 1h 24m
- 2221. QuickSort in Python38m
- 2322. Divide and Conquer46m
Day 13 · 53m
- 2424. Fractional Knapsack , Greedy Algorithm Part 253m
Day 14 · 1h 38m
- 2525. Dynamic Programming 01 Knapsack Problem1h 38m
Week 3Videos 26–28 · 22h 20m
Day 15 · 51m
- 2623. Greedy Algorithm51m
Day 16 · 11h 12m
- 27Complete DSA in Hindi Part 1 | Chai aur DSA11h 12m
Day 17 · 10h 17m
- 28Complete DSA in Hindi Part 2 | Chai aur DSA10h 17m
Tips for finishing
- Watch either the individual episodes or the two compilation videos (27 and 28), not both. Tick off the ones you skip in the playlist length calculator and the planner will drop them.
- Implement each structure in Python from scratch before using the built-in list and dict shortcuts.