Dijkstra's (Weighted Shortest Path) Problems
35 Dijkstra's (Weighted Shortest Path) problems on LeetCode, a Advanced Graphs interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Network Delay Time | Medium | 1566 | 88 | Heap Simulation |
| 2 | Cheapest Flights Within K Stops | Medium | 1786 | 82 | BFS Shortest Path (Unweighted) · Linear Recurrence DP |
| 3 | Path With Minimum Effort | Hard | 1948 | 78 | Binary Search on Answer Space · Union-Find |
| 4 | Swim in Rising Water | Hard | 2097 | 78 | Binary Search on Answer Space · Union-Find |
| 5 | Find the Closest Marked NodePREMIUM | Medium | 1432 | 72 |
MORE ADVANCED GRAPHS PATTERNS
// your mastery
What's your Dijkstra's (Weighted Shortest Path) tier?
leaps.gg syncs your LeetCode history, scores your Dijkstra's (Weighted Shortest Path) mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →