Notes TODO Data Structures [x] Sparse Tables [x] Segment Trees [x] Monotonic Stacks/Queues [x] Heavy/Light Decompositions TODO Algorithms [ ] Kosaraju’s [x] Djikstra’s [x] Tarjan’s [ ] Kruskal’s [x] KMP [x] Rabin-Karp TODO Study [x] Greedy [x] Beginner [x] Intermediate [ ] Advanced [x] Trees [x] LCA [x] Heavy-Light Decompositions [x] Sparse Table [x] Segment Tree Beats [x] Network Flows [x] Max Flow [ ] Dinic’s [x] Floyd-Warshall [x] Edmonds-Karp Combinatorial Theory [x] Beginner [x] Intermediate [ ] Advanced Number Theory [x] Sieve of Eratosthenes [x] Prime Number Theory [x] Factorialization Concepts Range Queries/Segment Trees [x] Lazy Propagation [x] Static vs. Dynamic [x] “Beats” [x] 2D SegTrees Geometry [x] Bounding Boxes [x] Cross Product [x] Computing Area of a Triangle [x] Maximal Rectangle [x] Histograms Dynamic Programming [x] Knapsack [x] Coins [x] LCS [ ] Print Back Optimal String [x] LIS [x] Probability [x] Bitmasks [x] Graph [x] Tree [x] 2-Layer 1D DP [x] 2D DP (General Concepts) [ ] 3D DP [x] Tiling/Dominoes (2x1 Grid) [x] Tiling/Dominoes (4x1 Grid)