Courses

The Technical Interview Course

Everything you need to solve all 150 NeetCode problems, in an order designed so you can attempt every one of them honestly.

24 units170 lessons176 problems~145 hours

Syllabus

Unit 05 lessonsFoundationsThe Python you need, the cost model you reason with, and a procedure for attacking a problem you have never seen. No NeetCode problems here on purpose.
Unit 110 lessonsArrays and HashingThe hash map is the highest-leverage tool in the course. Nine problems, each adding exactly one idea to the one before it, ending with a loop that looks quadratic and is not.
Unit 26 lessonsTwo PointersFive problems built on one question: when a pointer moves, what is being permanently discarded, and what makes that safe?
Unit 36 lessonsSliding WindowTwo pointers that only move forward. Each lesson asks the same question with harder state: what must the window remember to know whether it is still valid?
Checkpoint 13 lessonsCheckpoint: arrays, pointers, and windowsThree problems rebuilt cold, then four you have never seen. The last one needs two taught ideas at once, which is what every Medium problem from here on will ask of you.
Unit 48 lessonsStacks and Monotonic StructuresPlain stacks for nesting, then the monotonic stack: discard every candidate that can never be the answer, and what remains is ordered for free.
Unit 58 lessonsBinary SearchNot looking up a value in a sorted array. Finding the point where a yes-or-no property flips, which turns out to cover answer spaces, rotated arrays, and partitions too.
Unit 66 lessonsIntervalsSort by the right key, then make one pass. A lighter unit after two dense ones, built around the overlap test and the single decision of start versus end.
Checkpoint 23 lessonsCheckpoint: stacks, search, and intervalsThree cold rebuilds, then five unseen problems. Two of them are intervals wanting different techniques, which is the discrimination this checkpoint is really testing.
Unit 712 lessonsLinked ListsAlmost no algorithmic content and a great deal of care. Every bug here is the same bug, so every lesson names one specific way a reference gets dropped.
Unit 813 lessonsRecursion and TreesOpens with recursion itself, carrying no problems, because backtracking and dynamic programming both depend on it. Then fifteen problems on a structure that is already recursive, so the code can mirror it exactly.
Unit 98 lessonsHeaps and Priority QueuesOne structure that answers a single question cheaply. Seven heap problems plus the interval problem Unit 6 deferred, because it needed exactly this.
Checkpoint 35 lessonsCheckpoint: midpoint mock roundTwo timed 45 minute rounds shaped like real interviews, an untimed stretch problem, and a debrief that diagnoses process rather than answers.
Unit 1010 lessonsBacktrackingRecursion with an undo step. Ten problems where the only things that change are what counts as a choice and how you avoid making the same one twice.
Unit 114 lessonsTriesOne idea, three problems: share the prefix instead of storing it once per word. Placed here so the grid problem arrives one unit after you solved its single-word version by hand.
Unit 128 lessonsGraphsTree traversal on a structure that loops back, so the only new thing is the visited set. Then a series of questions about where to start and which order to visit in, plus union-find for connectivity that changes over time.
Unit 136 lessonsAdvanced GraphsBreadth-first search finds shortest paths only when every edge costs the same. Six problems about what replaces it when they do not, and every one of them is U12's traversal with a different structure deciding what comes next.
Checkpoint 43 lessonsCheckpoint: recursion and graphsThree cold rebuilds, then six unseen problems across recursion, generation, traversal, connectivity, and design. Two of them are not the kind of problem they appear to be.
Unit 1411 lessonsOne-dimensional Dynamic ProgrammingRecursion with the answers remembered, deferred until now because it needs everything before it. Twelve problems, each climbing the same ladder from a slow recursion to whatever few variables the table actually needs.
Unit 1511 lessonsTwo-dimensional Dynamic ProgrammingEverything from the previous unit, with a subproblem that needs two numbers to name it. Ordered by how hard the state is to find rather than how hard the code is.
Unit 169 lessonsGreedyPlaced after both dynamic programming units so the unit can ask the only interesting question about a greedy rule: why is this local choice safe here when it was not safe there?
Unit 175 lessonsMath and GeometryEight problems with no shared algorithm. What they share is that the difficulty is index arithmetic and edge cases rather than an idea, so the unit is about being systematic instead of clever.
Unit 185 lessonsBit ManipulationSeven problems and the last teaching unit. Self-contained, placed here so the counting recurrence reads easily and so Python's arbitrary-precision integers can be contrasted with the fixed width these problems assume.
Checkpoint 55 lessonsFinal checkpoint: mixed interview roundsThree timed rounds drawn from the whole course, with no labels, and a debrief about what to do next rather than about the problems.