Geometry

point
vector
dot and cross 1
convex hull
binary/ternary search on convex hull
rotating callipers
winding number/ray shooting 2
Half Plan Intersection
Minimum Enclosing Circle
Polygon Union
Hill climbing 3
3d geometry
Algebric Geometry (minkowski sum) 4

Graph Theory
Undirected/Directed Graphs, Trees, Types of graphs etc definitions
Adjacency Matrix and Lists
DFS, BFS
DFS Tree
Graph Coloring, connected components
Diameter of a tree
Topological Sort(with DFS, with BFS) 5
Floyd Warshall
Dijkstra
0-1 BFS
SPFA
SCC
Articulation Point and Bridge 6
MST
LCA 7
Flow and Matching 8
Number Theory
Primes
GCD and LCM
Sieve and factorization
Number of divisors
Segmented Sieve
Euler Totient Funtion 9
Overflow in modular mul
Bigmod
Mulmod
Modular inverse
10
Extended Euclid, Linear Diophantine, CRT
Baby step giant step(discrete log/root)
Linear Sieve
Millar Rabin
Pollar Rho 11
Mobius Inversion
Dirichlet Convolution 12
Game Theory
NIM
Grundy Numbers 13
Linear Algebra
Combinatorics
Probabilities
Expected Value 14
Matrix Exponentiation 15
Gaussian Elimination(Inverse of a Matrix)
Basis Vector
Berlekamp Messey (Reeds–Sloane)
Lagrange Interpolation 16
FFT
NTT 17
String
KMP/Z
Prefix Automaton
String Hashing 18
Pattern Matching with FFT
Pattern Matching with Bitset
Binary Search on Hashing
Aho Corasick 19
Manacher
Suffix Array
Palindromic Tree 20
Suffix Automaton 21
Data Structure
Bit manipulation
Bitset
Subset enumeration
22
Segment Tree
Segment Tree Lazy
Intro to BIT
Order statistics tree and the number of inversions.
DSU
Sparse Table 23
Merge Sort Tree
Persistant Segment Tree
Wavelet Tree
24
Trie
Trie xor max/min
DSU and small to large technique
Monotonous queue 25
Sqrt Decomposition
MO's
Queries on tree (Euler tour technique) / Tree Flattening
26
HLD
Centroid Decomposition 27
Treap
Rope 28

Dynamic Programming
Recursions/Backtracking
Intro to DP
0/1 Knapsack
Longest Common Subsequence 29
Kadane's Algorithm
LIS in O(n^2) and O(n log n)
Inclusion Exclusion Principle
DP with output tracking 30
Digit DP
Bitmask DP
SOS DP 31
DP optimization
Tree DP (rerooting) 32
DP optimization: Divide and conquer
DP optimization: Knuth
Dynamic Convex Hull Trick
DP optimization: Alien Trick 33

Miscellaneous
Ternary Search (on doubles and integers)
Coordinate Compression
Pigeonhole Principle
34
Two Pointers
Sliding Window 35
Meet in the middle
Trick with subarray gcd (logn different gcds) 36