Comprehensive walkthrough of shortest path algorithms (Dijkstra, Bellman-Ford) and 1D/2D Dynamic Programming state transitions with curated problem sets.