- Prime Miller Rabin
- Matrix Recurrence + Fast Modulo

Multiplication for counting - Stable Marriage Problem
- Gaussian Elimination
- Numerical Integration/Differentiation
- Line Clipping
- Advanced Maths Ad-Hoc problems
- Aho–Corasick string matching

algorithm; - Calculate nCr % M Lucas’s Theorem
- Heavy Light decomposition in trees
- Inverse Modulo operations
- Pollard Rho Integer Factorization
- Flow related algorithms, assignment

problem, Hungarian algorithm - Bipartite matching algorithms
- Heavy-light decomposition
- Sweep line algorithm
- Z algorithm
- Convex Hull
- Suffix Arrays
- LCP
- Extended Euclid’s algorithm
- Ternary Search
- Segment tree (with lazy propagation)
- Interval Tree
- Binary Indexed Tree
- Fast Modulo Multiplication

(Exponential Squaring) - Heuristic Algorithms
- KMP string searching
- Manacher’s Algorithm
- Union Find/Disjoint Set
- Trie
- Fast Fourier Transform for fast

polynomial multiplication - Djikstra’s algorithm, Bellman-ford

algorithm, Floyd-Warshall Algorithm - Prim’s Algorithm, Kruskal’s Algorithm
- RMQ, LCA
- Suffix Tree
- Catalan Numbers

For Data Structure and Algorithm, follow **Data Structure and Algorithm made Easy by Narashima Kauromanchi**