- Modular Exponentiation
- Sorting
- Sieve of Eratosthenes
- Binary Search
- Union Find
- Strongly Connected Components
- Euler Walk
- Articulation Points
- Bridges
- Bridge Tree
- Topological Sorting
- Dijkstra
- Floyd Warshall
- Bellman Ford
- Minimum Spanning Tree (Kruskal/Prim)
- Lowest Common Ancestor
- Centroid Decomposition
- Flows (Dinic/Edmonds Karp)
- Matching (Hungarian Algorithm)
- 2-SAT
- Bellman Ford
- Segment Tree
- 2D Segment Tree
- Implicit Segment Tree
- Binary Indexed Tree
- STL (set/priority_queue/map/stack/queue/list/deque)
- Binary Search Tree
- Sparse Table
- Hashing
- Trie
- KMP
- Aho Corasick
- Suffix Array/Tree
- ETF
- Mobius Inversion
- FFT
- Chinese Remainder Theorem
- Complex Library (C++)
- Inclusion/Exclusion
- Extended Euclid
- Diophantine Equation
- Discrete Logarithm
- Modular Inverse
- Burnside's Lemma
- Matrix Exponentiation
- Gaussian Elimination
- Various forms for area of triangle (three point form, side length form etc.)
- If
xlies on line segmenta -- b - If segment
a -- bintersects withp -- q - Point in Polygon problem
- Pick's Theorem
- Convex Hull Optimization
- Knuth Optimization
- DP with bitmasks
- Nim
- Hackenbush
- Grundy Numbers
- Line Sweep Algorithms
- Square Root Decomposition
- Mo's Algorithm
- Heavy Light Decomposition
- Persistent Data Structures
- Treaps