Shortest Path Interview Questions

Array String Depth-First Search Breadth-First Search Union-Find Graph Theory Shortest Path Bellman–Ford Algorithm Floyd–Warshall Algorithm

Rank

#803MediumFrequency: 65.5%

Cheapest Flights Within K Stops

Asked at Airbnb

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

Rank

#3627MediumFrequency: 65.4%

Find Minimum Time to Reach Last Room I

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

Rank

#505MediumFrequency: 54.1%

The Maze II

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

Rank

#3628MediumFrequency: 52.1%

Find Minimum Time to Reach Last Room II

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

Rank

#1456MediumFrequency: 47.5%

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

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

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS 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

#3655MediumFrequency: 32.8%

Digit Operations to Make Two Integers Equal

Asked at Microsoft

Math Graph Theory Heap (Priority Queue)Number Theory Shortest Path

#10

Rank

#2321HardFrequency: 31.8%

Minimum Weighted Subgraph With the Required Paths

Graph Theory Heap (Priority Queue)Shortest Path

#11

Rank

#3386HardFrequency: 27.3%

Find Edges in Shortest Paths

Asked at DoorDash

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#12

Rank

#1959MediumFrequency: 26.7%

Minimum Path Cost in a Hidden Grid

Asked at Meta

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Interactive Shortest Path

#13

Rank

#1325MediumFrequency: 25.4%

Path with Maximum Probability

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

#14

Rank

#3887MediumFrequency: 25.3%

Minimum Cost Path with Edge Reversals

Asked at Oracle

Graph Theory Heap (Priority Queue)Shortest Path

#15

Rank

#2090MediumFrequency: 24.4%

Number of Ways to Arrive at Destination

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

#16

Rank

#2375HardFrequency: 23.3%

Minimum Obstacle Removal to Reach Corner

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

#17

Rank

#1912MediumFrequency: 20.9%

Number of Restricted Paths From First to Last Node

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

#18

Rank

#3720MediumFrequency: 20.3%

Minimize the Maximum Edge Weight of Graph

Binary Search Depth-First Search Breadth-First Search Graph Theory Shortest Path

#19

Rank

#2056MediumFrequency: 20%

Jump Game VIII

Array Dynamic Programming Stack Graph Theory Monotonic Stack Shortest Path

#20

Rank

#2711HardFrequency: 16.1%

Minimum Time to Visit a Cell In a Grid

Asked at Microsoft

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#21

Rank

#3558MediumFrequency: 14.6%

Find a Safe Walk Through a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#22

Rank

#2171HardFrequency: 12.6%

Second Minimum Time to Reach Destination

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

#23

Rank

#3235MediumFrequency: 10.3%

Minimum Cost to Convert String I

Array String Graph Theory Shortest Path

#24

Rank

#3919HardFrequency: 10.3%

Network Recovery Pathways

Array Binary Search Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path

#25

Rank

#3238HardFrequency: 7.3%

Minimum Cost to Convert String II

Asked at Microsoft

Array String Dynamic Programming Graph Theory Trie Shortest Path

#26

Rank

#2803HardFrequency: 5.5%

Modify Graph Edge Weights

Graph Theory Heap (Priority Queue)Shortest Path

#27

Rank

#499HardFrequency: 5%

The Maze III

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

#28

Rank

#918HardFrequency: 5%

Reachable Nodes In Subdivided Graph

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

#29

Rank

#3976HardFrequency: 5%

Minimum Cost to Buy Apples II