Practice problems across 75+ categories
Practice problems frequently asked at Shortest Path • 35 problems | 0 Easy | 21 Medium | 14 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 16 | Minimum Cost to Convert String I | Medium | ArrayStringGraph |
| 17 | Minimum Cost to Convert String II | Hard | ArrayStringDynamic Programming |
| 18 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | ArrayBreadth-First SearchGraph |
| 19 | Minimum Cost to Reach City With Discounts | Medium | GraphHeap (Priority Queue)Shortest Path |
| 20 | Minimum Obstacle Removal to Reach Corner | Hard | ArrayBreadth-First SearchGraph |
| 21 | Minimum Path Cost in a Hidden Grid | Medium | ArrayDepth-First SearchBreadth-First Search |
| 22 | Minimum Time to Transport All Individuals | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 23 | Minimum Time to Visit a Cell In a Grid | Hard | ArrayBreadth-First SearchGraph |
| 24 | Minimum Time to Visit Disappearing Nodes | Medium | ArrayGraphHeap (Priority Queue) |
| 25 | Minimum Weighted Subgraph With the Required Paths | Hard | GraphShortest Path |
| 26 | Modify Graph Edge Weights | Hard | GraphHeap (Priority Queue)Shortest Path |
| 27 | Network Delay Time | Medium | Depth-First SearchBreadth-First SearchGraph |
| 28 | Number of Possible Sets of Closing Branches | Hard | Bit ManipulationGraphHeap (Priority Queue) |
| 29 | Number of Restricted Paths From First to Last Node | Medium | Dynamic ProgrammingGraphTopological Sort |
| 30 | Number of Ways to Arrive at Destination | Medium | Dynamic ProgrammingGraphTopological Sort |
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.
