Loading…
Loading…
Loading…
Every practice problem from the course, in one priority order — do these, in this order, instead of jumping around by pattern. Matches the course's study plan.
Two pointers, hash maps, sliding windows, prefix sums — these solve a huge fraction of real interview problems for the least cost to learn.
Pointer rewiring and the halving trick — binary search extends far beyond a plain sorted array.
The linear data structures that show up constantly: monotonic stacks, top-K heaps, and merge/sweep over ranges.
DFS, BFS, and BST properties, then the same traversal ideas extended to graphs — and tries as a specialized tree for strings.
Backtracking, dynamic programming, and greedy — the three techniques that need the most reps, and the ones that most separate a pass from a strong hire.
Bit tricks for the O(1)-space follow-up questions. By this point, re-read the pattern cheat sheet daily and run mock interviews.