progress

~/problems

Problems

Basics first, then the classics, then company-style assessments. Every problem has tests you run right here; multi-level ones unlock as you go. See the roadmap.

First Quest

The gentle way in: warm-ups, short story problems and the famous first classics across 14 interview topics, from hash maps to bit tricks.

0 of 45 solved · about 10 hours in all

45 problems

Interview roadmap

Arrays & hashing Counting, lookups, sorting with keys, prefix sums.

Hash maps and counting guide

Two pointers Scan from both ends, or fast and slow.

Stacks Matching brackets, paths, next greater element.

Stacks guide

Sliding window Grow and shrink a window over a string or array.

Linked lists Reverse, merge, detect cycles, build an LRU cache.

Linked lists guide

Trees Traversals, BSTs, and answers built bottom-up.

Binary trees guide

Heaps Top-k, merging streams, scheduling by time.

Heaps and priority queues guide

Backtracking Recursion that tries, undoes and tries again.

Intervals Merge, insert and sweep over ranges.

Graphs Grids and networks: BFS, DFS, cycles, ordering.

BFS / multi-source BFS guide

DFS and connected components guide

1-D dynamic programming One index of state: stairs, robbers, subsequences.

Intro DP guide

Bit manipulation Masks, shifts and IP-address arithmetic.

esc