Algorithm Trees & Graphs Data Structures & Advanced Algorithms Math & Number Theory Others Sorting & Search stl Optimization Network Flow Geometry segment tree Strings Basic Algorithms DP dynamic programming shortest path divide and conquer heuristic binary search Strongly Connected Component Matrices bipartite matching primality test MST Linear algebra SCC minimum spanning tree Square Root Decomposition Bitmasks Longest Common Subsequence convex hull Tree Traversal Graph Traversal LCS BFS Heap Mo's Algorithm Red-Black Tree Bit DP Convex Hull Trick BitSet Fenwick Tree combinatorics CHT hashing Game Theory SA Algorithms deque vector ford-fulkerson method precomputation constructive case work offline query matroid knuth's x dancing links floyd's tortoise and hare algorithm dlas diversified late acceptance search late acceptance hill climbing d* bidirectional search imos method bitset lcs hirschburg's algorithm bulldozer trick rotating sweep line alien's trick connection profile dp offline dynamic connectivity slope trick knuth's optimization monotone queue optimization d&c opt divide and conquer optimization counting points in triangle small to large technique li-chao tree link-cut tree dominator tree van emde boas tree eertree centroid decomposition hld heavy-light decomposition segment tree beats continuous sum segment tree egcd persistent segment tree wavelet tree fibonacci heap Interval Tree PBDS Data Structures & Advanced Algorithms Policy-Based Data Structures Hilbert Mo's meet in the middle Discrete Square Root Euler Tour Technique Non-Recursive Segment Tree GCD Segment Tree Segment Tree with Lazy Propagation 2D Fenwick Tree 2D Segment Tree merge sort tree Graph Realization Problem Tree Isomorphism Dual Graph General Matching Gale-Shapley Algorithm Stable Marriage Problem Hopcroft-Karp Algorithm Relabel-To-Front Algorithm Push-Relabel Algorithm Dinic's Algorithm LR Flow Edmonds-Karp Algorithm sweeping Block-Cut Tree Biconnected Component Tarjan's Algorithm B+Tree Dynamic Segment Tree Kosaraju's Algorithm Eulerian Circuit Eulerian Path Sollin's Algorithm Borůvka's Algorithm coordinate compression Directed Acyclic Graph Independent Set Dial's Algorithm 0-1 BFS Shortest Path Faster Algorithm randomization Diameter of Tree Postorder Traversal Inorder Traversal Number Theoretic Transform AVL Tree Preorder Traversal sparse table Topological Sorting Bipartite Graph Half Plane Intersection Bentley-Ottmann Algorithm Shamos-Hoey Algorithm Monotone Chain Andrew's Algorithm Graham Scan Line Intersection Counterclockwise Function Aho-Corasick LCP Array Treap Manacher Rabin-Karp Knuth-Morris-Pratt SOS DP Sum over Subsets Deque DP Bitfield Berlekamp-Massey Kitamasa Method Hensel's Lemma Lagrange's Theorem Tonelli-Shanks Algorithm Discrete Logarithm Pollard's Rho Miller-Rabin Primality Test Burnside's Lemma Möbius Inversion Formula Inclusion-Exclusion Principle Lowest Common Ancestor Sprague-Grundy Theorem Sum of Squares Strassen's Algorithm RREF Rank of Matrix Karatsuba's Algorithm Permutation Cycle Decomposition Bogobogo Sort Bogo Sort Shell's Sort Intro Sort Tim Sort Euler's Phi Function Euler's Totient Function Lucas' Theory Pigeonhole Principle Extended Euclidean Algorithm Modular Operation Power by Divide and Conquer Parallel Binary Search Ternary Search splay tree Other Sorting Method tree dp valarray hash_multimap hash_multiset unordered_multimap unordered_multiset unordered_set forward_list prim's algorithm prime factorization 2-SAT unordered_map ODC Two Pointers Pruning Sieve of Eratosthenes D&C prefix sum union-find Fast Fourier Transform Floyd-Warshall Gaussian elimination bellman-ford linear search mcmf ccw rotating calipers memoization minimum cost maximum flow parametric search minimum vertex cover nim game Disjoint Set priority_queue hungarian algorithm trie spfa flood fill LIS Bayes' Theorem Probability hash_set hash_map Simulated Annealing Longest Increasing Subsequence Breadth First Search Delaunay triangulation voronoi diagram Euclidean algorithm mitm PST Depth First Search Comb Sort Cocktail Sort suffix array minimum cut quick sort kruskal's algorithm rope LCA BCC selection sort multimap multiset chinese remainder theorem radix sort circulation tuple ad-hoc failure function sliding window clique DAG recursion ETT Cactus SMP articulation parsing ntt dfs counting sort heap sort merge sort DLX Regex generic algorithm GCD GA pair string backtracking fft Regular Expression greedy A* set grid interactive pbs bubble sort insertion sort order CRT Implementation Simulation span b-tree KMP Z ASCII array CW Queue MVC list Brute Force Stack Dijkstra map