My competitive programming reference
- Binary Indexed Tree 2D
- Mo's Algorithm
- Persistent Segment Tree
- Segment Tree 2D
- Splay Tree
- Convex Hull Trick
- Dynamic Convex Hull Trick
- Nim Multiplication
- Centroid Decomposition
- Dominator Tree
- Euler Circuit
- Ford Fulkerson
- Heavy Light Decomposition
- Lowest Common Ancestor
- Maximum Matching on Bipartite Graph
- Minimum Vertex Cover on Bipartite Graph
- Tarjan Algorithm
- Topo Sort
- 2-SAT
- Discrete Fourier Transform (DFT):
- Fast Fourier Transform (FFT)
- Number Theoretic Transform (NTT)
- Extended Euclidean Algorithm
- Gaussian Elimination
- Suffix Array
- Z-Function