| 1 |
Coin Change (Greedy & DP), Huffman Coding, Knapsack (Fractional & 0/1 with Fibonacci weights), Three‑Sum + Scheduling with Decoding & Payment Constraint |
đź“„ PDF |
| 2 |
Fast Fibonacci (Divide & Conquer), Treasure Selection (LCS + Non‑decreasing order), Island Rescue Network (MST with Prim + stability preference), Server Management (Tree + adjacent constraints) |
đź“„ PDF |
| 3 |
Johnson’s two‑machine scheduling, Floyd‑Warshall all‑pairs shortest paths, Fiber optic network (MST with cable type limit), Fibonacci Heap for dynamic graph paths |
đź“„ PDF |
| 4 |
Fast power (Divide & Conquer), Closest pair of points (Divide & Conquer), Strassen’s matrix multiplication, KMP pattern matching |
đź“„ PDF |
| 5 |
Residual Graph from Capacity & Flow, Maximum Bipartite Matching, Min s‑t Cut (Max Flow), Bottleneck Edges Identification |
đź“„ PDF |
