Open the review cheatsheet · Browse learning views · Use native Graph
Families
- Backtracking and constraint search
- Binary search and monotone answer
- Bit manipulation and bitmask state
- Divide and conquer
- DSU, MST, and offline activation
- Dynamic programming
- Geometry, sweep, simulation, and parsing
- Greedy and scheduling
- Heap, selection, and stream
- Math, number theory, and combinatorics
- Ordered frontier and path
- Pointers and sliding window
- Prefix, difference, and hashed state
- Range-query data structures
- Stack and monotone deque
- String matching, hashing, and palindrome
- Traversal and connectivity
- Tree, BST, and trie