Topic Maps¶
These pages collect source-backed learning references, exact practice sources, follow-up reading, repo companion material, curated external problems, and all currently tagged repo problems for each topic/subtopic.
Source types are normalized to the repo taxonomy: Primary, Course, Reference, Essay / Blog, and Practice.
| Topic | Repo Problems | Repo Companions | External Problems | Map |
|---|---|---|---|---|
| Foundations -> Binary Search | 1 | 0 | 6 | Open |
| Foundations -> Bit Tricks | 0 | 2 | 2 | Open |
| Foundations -> Complexity And Invariants | 3 | 1 | 8 | Open |
| Foundations -> C++ Language | 3 | 3 | 6 | Open |
| Foundations -> Difference Arrays | 1 | 0 | 5 | Open |
| Foundations -> Prefix Sums | 3 | 3 | 6 | Open |
| Foundations -> Recursion And Backtracking | 0 | 2 | 3 | Open |
| Foundations -> Sorting | 5 | 0 | 7 | Open |
| Foundations -> STL Basics | 1 | 0 | 8 | Open |
| Foundations -> Two Pointers | 4 | 3 | 6 | Open |
| Data Structures -> B-Trees | 1 | 5 | 1 | Open |
| Data Structures -> Balanced BSTs For Contests | 0 | 6 | 3 | Open |
| Data Structures -> Binary Trie / XOR Queries | 1 | 5 | 3 | Open |
| Data Structures -> DSU | 3 | 0 | 5 | Open |
| Data Structures -> DSU On Tree / Small-To-Large | 1 | 6 | 2 | Open |
| Data Structures -> DSU Rollback / Offline Dynamic Connectivity | 1 | 5 | 2 | Open |
| Data Structures -> Fenwick Tree | 4 | 0 | 6 | Open |
| Data Structures -> Heaps And Ordered Sets | 1 | 2 | 7 | Open |
| Data Structures -> Interval Trees | 1 | 6 | 1 | Open |
| Data Structures -> Lazy Segment Tree | 1 | 4 | 4 | Open |
| Data Structures -> Monotonic Stack / Queue | 1 | 3 | 3 | Open |
| Data Structures -> Mo's Algorithm | 1 | 5 | 4 | Open |
| Data Structures -> ODT / Chtholly | 1 | 4 | 2 | Open |
| Data Structures -> Offline Tricks | 2 | 0 | 7 | Open |
| Data Structures -> Pairing Heap / Leftist Heap | 1 | 4 | 2 | Open |
| Data Structures -> PBDS / Order Statistics Tree | 1 | 5 | 3 | Open |
| Data Structures -> Persistent Data Structures | 1 | 5 | 3 | Open |
| Data Structures -> Persistent Treap | 1 | 5 | 1 | Open |
| Data Structures -> Segment Tree | 4 | 0 | 8 | Open |
| Data Structures -> Segment Tree Beats | 1 | 5 | 2 | Open |
| Data Structures -> Skip Lists | 1 | 5 | 1 | Open |
| Data Structures -> Sparse Table | 1 | 0 | 3 | Open |
| Data Structures -> Splay Tree | 1 | 5 | 3 | Open |
| Data Structures -> Treap / Implicit Treap | 2 | 9 | 4 | Open |
| Data Structures -> Wavelet Tree | 1 | 5 | 3 | Open |
| Data Structures -> X-Fast / Y-Fast Tries | 1 | 5 | 1 | Open |
| Graphs -> BFS And DFS | 2 | 0 | 7 | Open |
| Graphs -> Bridges, Articulation, And BCC | 1 | 4 | 5 | Open |
| Graphs -> Centroid Decomposition | 1 | 5 | 5 | Open |
| Graphs -> De Bruijn Sequence | 1 | 5 | 1 | Open |
| Graphs -> Euler Tour / Subtree Queries | 1 | 4 | 4 | Open |
| Graphs -> Euler Tour Tree | 1 | 6 | 2 | Open |
| Graphs -> Eulerian Path / Cycle | 1 | 5 | 3 | Open |
| Graphs -> Maximum Flow | 5 | 4 | 8 | Open |
| Graphs -> Flow With Lower Bounds | 1 | 5 | 2 | Open |
| Graphs -> Edmonds Blossom / General Matching | 1 | 5 | 3 | Open |
| Graphs -> Randomized / Global Min-Cut | 1 | 5 | 3 | Open |
| Graphs -> Gomory-Hu Tree | 1 | 5 | 7 | Open |
| Graphs -> Graph Modeling | 4 | 2 | 9 | Open |
| Graphs -> Heavy-Light Decomposition | 2 | 0 | 8 | Open |
| Graphs -> Hungarian / Assignment Problem | 1 | 5 | 3 | Open |
| Graphs -> LCA | 1 | 0 | 6 | Open |
| Graphs -> Link-Cut Tree | 1 | 6 | 2 | Open |
| Graphs -> Matching | 2 | 0 | 12 | Open |
| Graphs -> Min-Cost Flow | 1 | 0 | 10 | Open |
| Graphs -> Minimum Spanning Tree | 1 | 0 | 6 | Open |
| Graphs -> Topological Sort And SCC | 2 | 0 | 9 | Open |
| Graphs -> Shortest Paths | 1 | 0 | 9 | Open |
| Graphs -> Stable Marriage | 1 | 5 | 2 | Open |
| Graphs -> Tree DP | 1 | 0 | 7 | Open |
| Graphs -> Tree Isomorphism | 1 | 5 | 2 | Open |
| Graphs -> Trees | 11 | 0 | 10 | Open |
| Graphs -> Two-SAT | 1 | 3 | 4 | Open |
| Graphs -> Virtual Tree / Auxiliary Tree | 1 | 5 | 2 | Open |
| DP -> Bit-Parallelism / Bitset Optimization | 1 | 5 | 2 | Open |
| DP -> Bitmask DP | 1 | 0 | 11 | Open |
| DP -> Broken Profile / Plug DP | 1 | 5 | 2 | Open |
| DP -> Convex Hull Trick / Li Chao Tree | 2 | 4 | 4 | Open |
| DP -> Digit DP | 1 | 0 | 15 | Open |
| DP -> Divide and Conquer DP | 1 | 5 | 2 | Open |
| DP -> Foundations | 2 | 0 | 12 | Open |
| DP -> FWHT / XOR Convolution / Subset Convolution | 1 | 5 | 2 | Open |
| DP -> Interval DP | 1 | 0 | 12 | Open |
| DP -> Knapsack Family | 1 | 0 | 15 | Open |
| DP -> Knuth Optimization | 1 | 6 | 2 | Open |
| DP -> Lagrangian Relaxation / Aliens Trick | 1 | 5 | 4 | Open |
| DP -> Sliding Window And Window DP | 2 | 2 | 16 | Open |
| DP -> Slope Trick | 1 | 4 | 4 | Open |
| DP -> SOS DP | 1 | 5 | 2 | Open |
| DP -> Tree DP | 3 | 0 | 10 | Open |
| Greedy -> Huffman / Data Compression | 1 | 5 | 1 | Open |
| Greedy -> Prefix Constraints | 3 | 3 | 8 | Open |
| Math -> Berlekamp-Massey / Kitamasa | 1 | 3 | 2 | Open |
| Math -> BSGS / Discrete Log | 1 | 4 | 2 | Open |
| Math -> Chinese Remainder And Linear Congruences | 1 | 3 | 2 | Open |
| Math -> Dirichlet Convolution / Prefix Sums Of Number-Theoretic Functions | 1 | 4 | 2 | Open |
| Math -> FFT And NTT | 2 | 0 | 8 | Open |
| Math -> Game Theory / Sprague-Grundy | 1 | 4 | 4 | Open |
| Math -> Gaussian Elimination And Linear Algebra | 1 | 4 | 2 | Open |
| Math -> GCD And LCM | 6 | 0 | 11 | Open |
| Math -> Linear Recurrence And Matrix Exponentiation | 1 | 3 | 3 | Open |
| Math -> Lucas Theorem And Large Binomial Mod Prime | 1 | 3 | 2 | Open |
| Math -> Min_25 / Du Jiao | 1 | 4 | 2 | Open |
| Math -> Mobius And Multiplicative Counting | 1 | 3 | 1 | Open |
| Math -> Modular Arithmetic | 4 | 2 | 8 | Open |
| Math -> Modular Square Root / Discrete Root | 1 | 4 | 2 | Open |
| Math -> Number Theory Basics | 7 | 0 | 13 | Open |
| Math -> Pollard-Rho | 1 | 4 | 1 | Open |
| Math -> Polynomial / Formal Power Series | 1 | 4 | 4 | Open |
| Math -> Primitive Root | 1 | 4 | 2 | Open |
| Math -> Probability | 1 | 4 | 4 | Open |
| Math -> XOR Basis / Linear Basis | 1 | 4 | 3 | Open |
| Combinatorics -> Bounded Compositions | 1 | 0 | 6 | Open |
| Combinatorics -> Burnside / Pólya / Group Actions | 1 | 3 | 2 | Open |
| Combinatorics -> Counting Basics | 2 | 0 | 13 | Open |
| Combinatorics -> Inclusion-Exclusion | 3 | 0 | 6 | Open |
| Combinatorics -> Lexicographic Enumeration | 1 | 0 | 7 | Open |
| Strings -> Aho-Corasick | 1 | 0 | 7 | Open |
| Strings -> Eertree / Palindromic Tree | 1 | 4 | 3 | Open |
| Strings -> Hashing | 1 | 0 | 7 | Open |
| Strings -> KMP | 3 | 0 | 5 | Open |
| Strings -> Palindromes / Manacher | 1 | 3 | 3 | Open |
| Strings -> Regular Expressions / Finite Automata | 1 | 5 | 1 | Open |
| Strings -> Suffix Array And LCP | 2 | 0 | 9 | Open |
| Strings -> Suffix Automaton | 1 | 0 | 8 | Open |
| Strings -> Suffix Tree | 1 | 5 | 2 | Open |
| Strings -> Trie | 2 | 0 | 4 | Open |
| Strings -> Z-Function | 2 | 0 | 5 | Open |
| Geometry -> Convex Hull | 1 | 0 | 6 | Open |
| Geometry -> Counting Geometry | 1 | 0 | 6 | Open |
| Geometry -> Half-Plane Intersection | 1 | 4 | 1 | Open |
| Geometry -> Minkowski Sum | 1 | 5 | 1 | Open |
| Geometry -> Nearest Pair of Points | 1 | 4 | 2 | Open |
| Geometry -> Polygon Area And Point Location | 5 | 2 | 4 | Open |
| Geometry -> Right Triangles | 1 | 0 | 5 | Open |
| Geometry -> Segment Intersection | 2 | 2 | 5 | Open |
| Geometry -> Sweep Line | 3 | 0 | 6 | Open |
| Geometry -> Vector And Orientation | 7 | 2 | 5 | Open |
| Advanced -> Algorithm Engineering | 3 | 5 | 8 | Open |
| Advanced -> Approximation And Relaxation | 0 | 2 | 5 | Open |
| Advanced -> Complexity And Hardness | 1 | 2 | 5 | Open |
| Advanced -> Constructive | 3 | 3 | 10 | Open |
| Advanced -> Contest Engineering | 0 | 5 | 6 | Open |
| Advanced -> Gradient Descent | 1 | 4 | 2 | Open |
| Advanced -> Machine Learning Algorithms | 1 | 4 | 2 | Open |
| Advanced -> Matroid Intersection | 1 | 5 | 1 | Open |
| Advanced -> Meet-In-The-Middle | 1 | 3 | 3 | Open |
| Advanced -> Online Algorithms | 1 | 5 | 2 | Open |
| Advanced -> Optimization And Duality | 2 | 2 | 6 | Open |
| Advanced -> Parallel Algorithms | 1 | 4 | 2 | Open |
| Advanced -> Quantum Algorithms | 1 | 4 | 2 | Open |
| Advanced -> Randomized Algorithms | 1 | 2 | 9 | Open |
| Advanced -> Simplex | 1 | 4 | 2 | Open |