-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Gargi Mahale edited this page Feb 12, 2021
·
1 revision
- Implementation; vectors and sets
- Binary search
- Prime sieve; prime check in O(sqrt(N))
- Dynamic Programming - Fibonacci numbers, prefix sums
- Sorting
- Greedy
- Ad-hoc
- Graphs - graph representation, BFS, DFS, trees
- Geometry - distance between two points
- Bitmasks
- Two pointers, sliding window
- Data structures - sqrt decomposition, segment trees, Fenwick/BIT, persistent structures, Policy-Based-DS, treaps, BST
- Ternary search
- Interactive problems
- LIS
- LCS
- Math
- Number theory
- Combinatorics, probability, EV
- Find & Union
- Game theory - NIM, Grundy
- Hashing
- Strings - KMP, Z
- Geometry - cross product, convex hull
- Matrix exponentiation
- Divide & Conquer
- DP optimizations
- Graphs - Dijkstra, FW, SCC, bridges, matching, flows
- Randomized algorithms
- TRIE
- Trees - bottom-up dp, LCA, Centroid decomposition, HLD, DSU
- 2-SAT
- Strings - suffix arrays
- Constructive algorithms
- Expression parsing
- Meet in the middle
- FFT
- Chinese remainder theorem
- Gaussian elimination
- Difference array, binary lifting