Coding Interview Questions by Concept
63 algorithms and concepts, tagged across 1,610+ real interview questions. Pick a concept to see every question that tests it and which companies ask them.
System design concepts
Design interviews test a different toolbox: architectures instead of algorithms. Each of these is a free interactive course with animated request flows and runnable simulations, and the design library has full prompts to apply them on.
- Caching5 lessons · ~51 minAnswer the repeat questions from memory, and most of your traffic never touches the database.Learn it10 design problems
- Load Balancing & Scaling5 lessons · ~50 minOne server becomes twenty behind a single address, and nobody on the outside can tell.Learn it10 design problems
- Database Scaling5 lessons · ~52 minIndex it, replicate it, then shard it, in that order and only as far as the numbers force you.Learn it14 design problems
- Consistency & Trade-offs5 lessons · ~51 minWhen the network splits, you choose what breaks. Know what you're choosing.Learn it11 design problems
- Queues & Async Processing5 lessons · ~50 minTake the slow work out of the request, promise to do it soon, and smooth every spike.Learn it12 design problems
Coding concepts
- Array1610
- String663
- Hash Table569
- Math507
- Dynamic Programming503
- Sorting408
- Greedy373
- Binary Search242
- Bit Manipulation223
- Depth-First Search223
- Matrix210
- Prefix Sum193
- Breadth-First Search188
- Two Pointers184
- Simulation163
- Counting159
- Tree156
- Heap (Priority Queue)151
- Graph Theory130
- Sliding Window129
- Stack127
- Binary Tree115
- Enumeration114
- Backtracking87
- Number Theory76
- Union-Find74
- Monotonic Stack54
- Divide and Conquer47
- Segment Tree46
- Combinatorics44
- Linked List43
- Bitmask40
- Recursion40
- Memoization39
- Geometry37
- Ordered Set37
- Trie37
- String Matching32
- Queue29
- Binary Indexed Tree28
- Hash Function27
- Topological Sort27
- Shortest Path26
- Binary Search Tree25
- Game Theory24
- Rolling Hash23
- Brainteaser17
- Monotonic Queue17
- Counting Sort9
- Merge Sort9
- Quickselect7
- Bucket Sort6
- Sweep Line6
- Probability and Statistics4
- Suffix Array4
- Eulerian Circuit3
- Minimum Spanning Tree3
- Radix Sort3
- Doubly-Linked List2
- Strongly Connected Component2
- Biconnected Component1
- Randomized1
- Sort1