Dashboard Questions Topics Companies Sheets

Shortest Path

Topic

31 coding problems covering Shortest Path concepts. Master this topic and improve your problem-solving skills.

Problems

Easy

Medium

Hard

Difficulty

All31 Easy0 Medium18 Hard13

Title	Solve	Difficulty	Companies	Topics
399. Evaluate Division	Solve	Medium	Adobe+8	Array Breadth-First Search+5
499. The Maze III	Solve	Hard	Google	Array Breadth-First Search+6
505. The Maze II	Solve	Medium	Bytedance+2	Array Breadth-First Search+5
743. Network Delay Time	Solve	Medium	Amazon+1	Breadth-First Search Depth-First Search+3
787. Cheapest Flights Within K Stops	Solve	Medium	Airbnb+15	Breadth-First Search Depth-First Search+4
882. Reachable Nodes In Subdivided Graph	Solve	Hard	-	Graph Heap (Priority Queue)+1
1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance	Solve	Medium	Akuna Capital+4	Dynamic Programming Graph+1
1368. Minimum Cost to Make at Least One Valid Path in a Grid	Solve	Hard	Google	Array Breadth-First Search+4
1514. Path with Maximum Probability	Solve	Medium	Google	Array Graph+2
1786. Number of Restricted Paths From First to Last Node	Solve	Medium	Google	Dynamic Programming Graph+3
1976. Number of Ways to Arrive at Destination	Solve	Medium	Bloomberg+1	Dynamic Programming Graph+2
2045. Second Minimum Time to Reach Destination	Solve	Hard	-	Breadth-First Search Graph+1
2093. Minimum Cost to Reach City With Discounts	Solve	Medium	Flipkart	Graph Heap (Priority Queue)+1
2203. Minimum Weighted Subgraph With the Required Paths	Solve	Hard	Google	Graph Shortest Path
2290. Minimum Obstacle Removal to Reach Corner	Solve	Hard	Google	Array Breadth-First Search+4
2297. Jump Game VIII	Solve	Medium	Amazon	Array Dynamic Programming+4
2473. Minimum Cost to Buy Apples	Solve	Medium	Directi	Array Graph+2
2577. Minimum Time to Visit a Cell In a Grid	Solve	Hard	Atlassian	Array Breadth-First Search+4
2642. Design Graph With Shortest Path Calculator	Solve	Hard	Samsung	Design Graph+2
2662. Minimum Cost of a Path With Special Roads	Solve	Medium	Samsung	Array Graph+2
2699. Modify Graph Edge Weights	Solve	Hard	-	Graph Heap (Priority Queue)+1
2714. Find Shortest Path with K Hops	Solve	Hard	-	Graph Heap (Priority Queue)+1
2737. Find the Closest Marked Node	Solve	Medium	-	Array Graph+2
2959. Number of Possible Sets of Closing Branches	Solve	Hard	Atlassian+2	Bit Manipulation Enumeration+3
2976. Minimum Cost to Convert String I	Solve	Medium	Atlassian	Array Graph+2
2977. Minimum Cost to Convert String II	Solve	Hard	Atlassian	Array Dynamic Programming+4
3112. Minimum Time to Visit Disappearing Nodes	Solve	Medium	-	Array Graph+2
3123. Find Edges in Shortest Paths	Solve	Hard	-	Breadth-First Search Depth-First Search+3
3286. Find a Safe Walk Through a Grid	Solve	Medium	-	Array Breadth-First Search+4
3341. Find Minimum Time to Reach Last Room I	Solve	Medium	-	Array Graph+3
3342. Find Minimum Time to Reach Last Room II	Solve	Medium	-	Array Graph+3