Data Structures
- BIT
- BIT 2D
- BIT Sparse
- BIT In Range
- Custom Hash
- Distinct Values In Range
- Dynamic Median
- Dynamic Wavelet Tree
- Implicit Treap
- LiChao Tree
- Line Container
- MergeSort Tree
- MultiSet
- Multiset Hash
- Permutation
- Policy Based Tree
- Query Tree
- Queue Query
- Randomized Heap
- Range Color
- RMQ
- Segment Tree
- Segment Tree 2D
- Segment Tree Iterative
- Segment Tree Lazy
- Segment Tree Persistent
- Sparse Table
- SQRT Decomposition
- SQRT Tree
- Stack Query
- Treap
- Union Find
- Union Find With Rollback
- Union Find Persistent
- Wavelet Tree
- Xor Trie
Graph Algorithms
- 2-SAT
- Arborescence
- Articulation Point
- BFS 0-1
- Bridge
- Centroid
- Centroid Decomposition
- Checking Bipartiteness Online
- Dijkstra
- Dinic
- Edmond's Blossoms
- Eulerian Path
- Find Cycle Negative
- Flow With Demand
- Floyd Warshall
- Graph Theorem
- Hungarian
- Prim
- Prufer Code
- HLD
- Kuhn
- Kruskal
- LCA
- Link-Cut Tree
- Link-Cut Tree - Edge
- Link-Cut Tree - Vertex
- Min-Cut
- Minimum Cost Maximum Flow
- Strongly Connected Component
- Topological Sort
- Tree
- Tree ID
- Vertex Cover In Tree
Dynamic Programming
- Alien Trick
- Divide and Conquer Optimization
- Divide and Conquer Optimization Implementation
- Knuth Optimization
- Knuth Optimization Implementation
Math
- Basic Math
- BigInt
- Catalan
- Binomial Coefficients
- Chinese Remainder Theorem
- Determinant
- Division Trick
- Euler's totient
- Extended Euclidean
- Fraction
- FFT
- Floyd Cycle Finding
- Function Root Using Newton
- Gauss
- Gauss Xor
- Gray Code
- Karatsuba
- Lagrange Interpolation
- Lagrange Poly
- Linear Sequence With Berlekamp Massey
- Linear Sequence With Reeds-Sloane
- Matrix
- Modular Arithmetic
- Modular Integer
- Montgomery Multiplication
- NTT
- Prime Number
- Rank Matrix
- Simpson Integration
- Sieve And Primes
- Xor-And-Or Convolution
Geometry
- Basic Geometry
- Circle Area Union
- Circles to Tree
- Count Lattices
- Convex Hull
- Convex Hull Trick
- Convex Polygon
- General Polygon
- Nearest Pair Of Points
- Point 3D
- Triangle
String Algorithms
- Aho Corasick
- KMP
- Manacher
- Min Cyclic String
- Palindromic Tree
- String Hashing
- Suffix Automaton
- Suffix Array
- Suffix Tree
- Trie
- Z Function
Miscellaneous
- Automaton
- Change STL
- Counting Inversions
- Fast IO
- Histogram
- Identify Pattern
- Kadane 1D and 2D
- Longest Increasing Subsequence
- Mo Algorithm
- Mo With Update
- Parallel Binary Search
- Pragma
- Random Function
- Polyominoes
- Scheduling Jobs
- Sprague Grundy
- Simplex
Theorems and Formulas