Dijkstra's Algorithm Interview Questions

Master 16 dijkstra's algorithm problems frequently asked in technical interviews. These questions test your understanding of dijkstra's algorithmconcepts and are essential for coding interview success.

Total Problems

Easy

Medium

Hard

Minimum Cost to Reach City With Discounts

Asked at Flipkart

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#505MediumFrequency: 54.1%

The Maze II

Asked at Uber

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

Rank

#1456MediumFrequency: 47.5%

Find the City With the Smallest Number of Neighbors at a Threshold Distance

Asked at Uber

Dynamic Programming Graph Theory Shortest Path Dijkstra's Algorithm Bellman–Ford Algorithm Floyd–Warshall Algorithm

Rank

#1485HardFrequency: 44.8%

Minimum Cost to Make at Least One Valid Path in a Grid

Asked at Uber

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

Rank

#2040HardFrequency: 43%

Minimum Cost to Reach Destination in Time

Asked at Databricks

Array Dynamic Programming Graph Theory Dijkstra's Algorithm

Rank

#744MediumFrequency: 41.2%

Network Delay Time

Asked at Salesforce

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#794HardFrequency: 40%

Swim in Rising Water

Asked at Meta

Array Binary Search Depth-First Search Breadth-First Search Union-Find Minimax Heap (Priority Queue)Matrix Dijkstra's Algorithm

Rank

#1753MediumFrequency: 37.3%

Path With Minimum Effort

Asked at Google

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

Rank

#1325MediumFrequency: 25.4%

Path with Maximum Probability

Asked at Google

Array Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#1099MediumFrequency: 25.4%

Path With Maximum Minimum Value

Asked at Google

Array Binary Search Depth-First Search Breadth-First Search Union-Find Heap (Priority Queue)Matrix Dijkstra's Algorithm

#10

Rank

#2090MediumFrequency: 24.4%

Number of Ways to Arrive at Destination

Asked at Google

Dynamic Programming Graph Theory Topological Sort Shortest Path Dijkstra's Algorithm

#11

Rank

#2375HardFrequency: 23.3%

Minimum Obstacle Removal to Reach Corner

Asked at Google

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#12

Rank

#1912MediumFrequency: 20.9%

Number of Restricted Paths From First to Last Node

Asked at Google

Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#13

Rank

#2171HardFrequency: 12.6%

Second Minimum Time to Reach Destination

Asked at Google

Breadth-First Search Graph Theory Shortest Path Dijkstra's Algorithm K Shortest Path

#14

Rank

#499HardFrequency: 5%

The Maze III

Asked at Google

Array String Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#15

Rank

#918HardFrequency: 5%

Reachable Nodes In Subdivided Graph

Asked at Google

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#16

Rank

View All Topics

Master Dijkstra's Algorithm in Real Interviews

Get AI-powered assistance when solving dijkstra's algorithm problems during your actual interviews.

Get Started Free

No credit card required

Dijkstra's Algorithm Interview Questions

Related Topics

Minimum Cost to Reach City With Discounts

The Maze II

Find the City With the Smallest Number of Neighbors at a Threshold Distance

Minimum Cost to Make at Least One Valid Path in a Grid

Minimum Cost to Reach Destination in Time

Network Delay Time

Swim in Rising Water

Path With Minimum Effort

Path with Maximum Probability

Path With Maximum Minimum Value

Number of Ways to Arrive at Destination

Minimum Obstacle Removal to Reach Corner

Number of Restricted Paths From First to Last Node

Second Minimum Time to Reach Destination

The Maze III

Reachable Nodes In Subdivided Graph

Master Dijkstra's Algorithm in Real Interviews

Dijkstra's Algorithm Interview Questions

Related Topics

Minimum Cost to Reach City With Discounts

The Maze II

Find the City With the Smallest Number of Neighbors at a Threshold Distance

Minimum Cost to Make at Least One Valid Path in a Grid

Minimum Cost to Reach Destination in Time

Network Delay Time

Swim in Rising Water

Path With Minimum Effort

Path with Maximum Probability

Path With Maximum Minimum Value

Number of Ways to Arrive at Destination

Minimum Obstacle Removal to Reach Corner

Number of Restricted Paths From First to Last Node

Second Minimum Time to Reach Destination

The Maze III

Reachable Nodes In Subdivided Graph

Master Dijkstra's Algorithm in Real Interviews