Aditya Verma's Binary Search Playlist: study plan and how long it takes
The Aditya Verma playlist is 21 videos and 4.3 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.
21 videos · 4.3 hours · Aditya Verma
A compact playlist on binary search variations: reverse sorted arrays, first and last occurrence, rotation count, nearly sorted arrays, floor and ceil, infinite arrays, peak elements, bitonic arrays and allocating minimum pages.
At about four hours it's one of the fastest ways to learn to spot binary search in problems that don't look like it.
Who it's for: Interview candidates who know basic binary search and want to recognise its variations.
How long does it take?
The full playlist is 4.3 hours across 21 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 | 9 days | 6 days | 5 days |
| 1 h a day | 5 days | 3 days | 3 days |
| 2 h a day | 3 days | 2 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 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–16 · 2h 38m
Day 1 · 27m
- 11 Binary Search Format Introduction5m
- 22 Binary Search13m
- 33 Binary Search on Reverse Sorted Array5m
- 44 Order Not Known Search4m
Day 2 · 19m
- 55 First and Last occurrence of an Element12m
- 66 Count of an Element in a Sorted Array7m
Day 3 · 23m
- 77 Number of Times a Sorted array is Rotated23m
Day 4 · 26m
- 88 Find an Element in a Rotated Sorted Array7m
- 99 Searching in a Nearly Sorted Array10m
- 1010 Find Floor of an element in a Sorted Array10m
Day 5 · 16m
- 1111 Ceil of an element in a Sorted Array6m
- 1212 Next Alphabetical Element10m
Day 6 · 24m
- 1313 Find position of an element in an Infinite Sorted Array15m
- 1414 Index of First 1 in a Binary Sorted Infinite Array9m
Day 7 · 24m
- 1515 Minimum Difference Element in a Sorted Array17m
- 1616 Binary Search on Answer Concept7m
Week 2Videos 17–21 · 1h 37m
Day 8 · 28m
- 1717 Peak Element22m
- 1818 Find maximum element in Bitonic Array6m
Day 9 · 28m
- 1919 Search An Element in Bitonic Array9m
- 2021 Search in Row wise And Column wise Sorted Array19m
Day 10 · 42m
- 21Allocate Minimum Number Of Pages42m
Tips for finishing
- Finish it in a week at 30 to 45 minutes a day, solving each variation on LeetCode or GeeksforGeeks right after the video.
- The final video on allocating minimum pages introduces binary search on answers; follow it up with Striver's playlist for more of those problems.