FAANG · quant · system design

Interview Map

The 300 problems that keep showing up, each one solved twice (brute force and optimal), in Python and Java, with the reasoning, the complexity and the words to say out loud.

Mastered
0
Due now
0
Learning
0
Streak
0🔥

300 of 300 problems · click any cell to dive in

ProblemPatternBrute forceOptimalComplexityEdge cases & testsSay it out loudStatus
Arrays & Hashing 22 · Count, look up and group in O(1) with hash maps and sets.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Strings 12 · Parsing, building and comparing text without wasted copies.
new
new
new
new
new
new
new
new
new
new
new
new
Two Pointers 10 · Two indexes walking toward or after each other.
new
new
new
new
new
new
new
new
new
new
Sliding Window 10 · Grow and shrink a range to keep it valid.
new
new
new
new
new
new
new
new
new
new
Stack 16 · Last in, first out: matching, undo and monotonic stacks.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Binary Search 12 · Halve the search space each step, on indexes or on answers.
new
new
new
new
new
new
new
new
new
new
new
new
Linked List 17 · Pointer surgery, dummy heads and fast/slow runners.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Trees 25 · Recursion on left and right, plus level-by-level BFS.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Tries 6 · Prefix trees for words and autocomplete.
new
new
new
new
new
new
Heap / Priority Queue 11 · Always grab the smallest (or largest) next item.
new
new
new
new
new
new
new
new
new
new
new
Backtracking 11 · Build choices step by step and undo dead ends.
new
new
new
new
new
new
new
new
new
new
new
Graphs 19 · BFS, DFS, union-find and topological order on networks and grids.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Advanced Graphs 8 · Weighted shortest paths and minimum spanning trees.
new
new
new
new
new
new
new
new
1-D Dynamic Programming 15 · Reuse answers to smaller prefixes.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
2-D Dynamic Programming 14 · Tables over two indexes: grids and pairs of strings.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
Greedy 9 · Take the locally best step when it provably stays optimal.
new
new
new
new
new
new
new
new
new
Intervals 9 · Sort by start, then merge, insert or count overlaps.
new
new
new
new
new
new
new
new
new
Math & Geometry 12 · Matrices, number tricks and careful arithmetic.
new
new
new
new
new
new
new
new
new
new
new
new
Bit Manipulation 8 · XOR, masks and shifts.
new
new
new
new
new
new
new
new
Data Structure Design 9 · Classes with operations that must hit target complexities.
new
new
new
new
new
new
new
new
new
Quant & Trading 25 · Pricing, probability, simulation and market-data problems asked at trading firms.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
System Design 20 · Scalable architectures, estimates and trade-offs, with one core component coded.
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new
new