Shortest Path
12 problems · 8 with full explanations
0 Easy6 Medium2 Hard
Shortest path algorithms find minimum-cost routes in graphs. Dijkstra (non-negative weights, O((V+E) log V)), Bellman-Ford (negative edges, O(VE)), Floyd-Warshall (all-pairs, O(V³)), and BFS (unweighted, O(V+E)). In C#, use PriorityQueue for Dijkstra.
How to practice
To practice Shortest Path problems effectively, start with the Easy problems listed below, trace through each solution on paper, then re-implement without looking. When you can recognise the shortest path pattern within 30 seconds of reading a new problem, move on to Medium difficulty. Use the related topic pages and our study guide for a structured progression.
All Shortest Path problems
- 1334.Find the City With the Smallest Number of Neighbors at a Threshold DistanceMedium
- 1514.Path with Maximum ProbabilityMedium
- 1976.Number of Ways to Arrive at DestinationMedium
- 2045.Second Minimum Time to Reach DestinationUnknown
- 2290.Minimum Obstacle Removal to Reach CornerHard
- 2577.Minimum Time to Visit a Cell In a GridHard
- 2699.Modify Graph Edge WeightsUnknown
- 2976.Minimum Cost to Convert String IMedium
- 2977.Minimum Cost to Convert String IIUnknown
- 3341.Find Minimum Time to Reach Last Room IMedium
- 3342.Find Minimum Time to Reach Last Room IIMedium
- 3651.Minimum Cost Path with TeleportationsUnknown