Shortest Path Coding Problems
Find optimal paths in graphs
35
Total Problems
0
Easy
21
Medium
14
Hard
Practice problems across 75+ categories
Practice problems frequently asked at Shortest Path • 35 problems | 0 Easy | 21 Medium | 14 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1 | Bellman-Ford Algorithm | Hard | Advanced GraphsGraphShortest Path |
| 2 | Cheapest Flights Within K Stops | Medium | Dynamic ProgrammingDepth-First SearchBreadth-First Search |
| 3 | Design Graph With Shortest Path Calculator | Hard | GraphDesignHeap (Priority Queue) |
| 4 | Digit Operations to Make Two Integers Equal | Medium | MathGraphHeap (Priority Queue) |
| 5 | Evaluate Division | Medium | ArrayStringDepth-First Search |
| 6 | Find a Safe Walk Through a Grid | Medium | ArrayBreadth-First SearchGraph |
| 7 | Find Edges in Shortest Paths | Hard | Depth-First SearchBreadth-First SearchGraph |
| 8 | Find Minimum Time to Reach Last Room I | Medium | ArrayGraphHeap (Priority Queue) |
| 9 | Find Minimum Time to Reach Last Room II | Medium | ArrayGraphHeap (Priority Queue) |
| 10 | Find Shortest Path with K Hops | Hard | GraphHeap (Priority Queue)Shortest Path |
| 11 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Dynamic ProgrammingGraphShortest Path |
| 12 | Find the Closest Marked Node | Medium | ArrayGraphHeap (Priority Queue) |
| 13 | Jump Game VIII | Medium | ArrayDynamic ProgrammingStack |
| 14 | Minimize the Maximum Edge Weight of Graph | Medium | Binary SearchDepth-First SearchBreadth-First Search |
| 15 | Minimum Cost of a Path With Special Roads | Medium | ArrayGraphHeap (Priority Queue) |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
