Aditya Verma
Aditya Verma DSA Patterns
Aditya Verma's DSA playlists, stitched into one course. Each topic is taught as a small set of recognisable patterns you can apply to unseen problems, rather than as a list of individual solutions — his dynamic programming and recursion series are widely treated as the best free explanations available. Covers recursion, DP (including DP on trees), sliding window, stack, heap, binary search, backtracking, graphs and string matching.
0%
0/223
Overall progress
0 / 223
What this playlist covers
Aditya Verma DSA Patterns by Aditya Verma runs to 223 videos across 12 sections: How to Approach Any Problem, Recursion, Dynamic Programming, Sliding Window, Stack, Heap, Binary Search and Backtracking, plus 4 more. Tick each video off as you finish it — progress is saved in this browser, and syncs across devices once you sign in. Nothing here is gated and there is no signup to start.
The best explanation of dynamic programming and recursion on YouTube, wrapped in a course that is weak almost everywhere else.
Who it is for
Someone who has hit the DP wall — who can follow a solution but cannot produce one, and keeps being told to 'just think recursively'. Watch it for what it is good at rather than as a complete course.
How to work through it
- 01How to Approach Any Problem (3) then Recursion (19), in order, without skipping. The recursion series is the foundation the DP series is built on and does not work as a standalone.
- 02Dynamic Programming (49). This is the reason to be here. Knapsack first, and let the rest of the tree hang off it — the point is the derivation, not the 49 answers.
- 03Sliding Window (13) is the other genuinely excellent series and can be watched independently at any time.
- 04Stack (11), Heap (10), Binary Search (21) as needed — each is self-contained.
- 05Graph (56), Backtracking (21), String Matching (7) only if you have nothing better. Other playlists here cover these better.
What it does well
- The recursion-to-memoisation-to-tabulation derivation is done out loud, every time, rather than presented as a finished recurrence. This is the thing almost every other course skips.
- Problems are grouped by the transformation that solves them, so you leave able to classify an unseen problem instead of recognising a seen one.
- The 13-video sliding window series covers the whole pattern space in under three hours.
Where it falls short
- Only 24 of 223 lectures link to a practice problem. You must source your own, and watching this without solving is especially tempting because the explanations are so satisfying.
- It is six separate playlists stitched into one course. Pacing, audio and production quality vary a lot between them.
- No language teaching, no arrays or strings fundamentals, thin on trees. This is not a first DSA course and does not try to be.
- Graph gets 56 videos but is not the series people come here for — Striver's is more structured and comes with problems attached.
What to pair it with
- Striver's A2Z DSA Course — Use it for the breadth this playlist does not have — arrays, trees, graphs — and come here for DP.
- AlgoMaster 150 — Somewhere to apply the patterns, since this playlist links almost no problems of its own.
- DSA patterns — The same pattern-first framing, in a form you can revise from quickly.