Aditya Verma's Sliding Window Playlist: study plan and how long it takes
The Aditya Verma playlist is 13 videos and 5.8 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.
13 videos · 5.8 hours · Aditya Verma
This playlist teaches fixed-size and variable-size sliding windows with a general template for each, then applies them to problems like maximum sum subarray, first negative in every window, anagram counts, longest substring without repeating characters and minimum window substring.
It's 13 videos, so you can finish it in a week and immediately use the templates on LeetCode.
Who it's for: Interview candidates who want a reliable template for subarray and substring problems.
How long does it take?
The full playlist is 5.8 hours across 13 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 | 12 days | 8 days | 6 days |
| 1 h a day | 6 days | 4 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–8 · 3h 28m
Day 1 · 28m
- 1Sliding Window Introduction Identification And Types23m
- 2Sliding Window Problems5m
Day 2 · 24m
- 3Maximum Sum Subarray of size K | Sliding Window24m
Day 3 · 32m
- 4First Negative Number in every Window of Size K | Sliding Window32m
Day 4 · 40m
- 5Count Occurrences Of Anagrams | Sliding Window40m
Day 5 · 38m
- 6Maximum of all subarrays of size k | Sliding Window38m
Day 6 · 25m
- 7Variable Size Sliding Window | Largest Subarray of sum K | Part125m
Day 7 · 21m
- 8Largest Subarray of sum K | Part221m
Week 2Videos 9–13 · 2h 18m
Day 8 · 16m
- 9Variable Size Sliding Window General Format16m
Day 9 · 30m
- 10Longest Substring With K Unique Characters | Variable Size Sliding Window30m
Day 10 · 28m
- 11Longest Substring With Without Repeating Characters | Variable Size Sliding Window28m
Day 11 · 24m
- 12Pick Toys | An Interesting Sliding Window Problem24m
Day 12 · 41m
- 13Minimum Window Substring | Variable Size Sliding Window41m
Tips for finishing
- Write down the fixed and variable window templates from videos 2 and 9 and reuse them for every problem.
- Minimum window substring (the last video) is a common hard interview question. Re-solve it a few days later.