Month 3 — Graphs & DP Deep

Weeks 13–16. Named-algorithm tier (MST, Tarjan, Hierholzer) → DP deep (interval DP, bitmask DP, digit DP) → string DP and harder bridge problems.

Weeks

• Week 13 — Advanced Graphs: MST (Kruskal + Prim), bipartite, bridges (Tarjan), Alien Dictionary, Reconstruct Itinerary (Hierholzer).
• Week 14 — Advanced DP: interval DP, bitmask DP, harder string DPs. (TBD)
• Week 15 — Game DP + digit DP + counting. (TBD)
• Week 16 — Practical engineering. (TBD)

Why this month

Foundational graphs (Weeks 5–7, 12) gave you BFS, DFS, Dijkstra, Bellman-Ford, Union-Find. Foundational DP (Week 12) gave you 1D and 2D string DP. This month layers on the named algorithms and the harder DP shapes that show up at L5+ interviews: Tarjan, Hierholzer, interval DP, bitmask DP. Each has a precise correctness argument; vagueness is penalized.