NeetCode 150 · Dijkstra's Shortest Path
Priority-queue-driven shortest path on a weighted graph with non-negative edges, greedily finalizing the closest node.
Sheet Problems: 1
Category: Graphs
ℹ
Curated selection from NeetCode 150
This sheet features 1 problem testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Dijkstra's Shortest Path Pattern Guide.
Featured Problems (1)
Explore More Patterns in NeetCode 150
Track your progress across all 150 problems in this curriculum roadmap.