| 399 | Evaluate Division | — | Medium | ArrayStringDepth-First Search | 63% | |
| 743 | Network Delay Time | — | Medium | Depth-First SearchBreadth-First SearchGraph | 57% | |
| 787 | Cheapest Flights Within K Stops | — | Medium | Dynamic ProgrammingDepth-First SearchBreadth-First Search | 40% | |
| 882 | Reachable Nodes In Subdivided Graph | — | Hard | GraphHeap (Priority Queue)Shortest Path | 51% | |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distanceread | — | Medium | Dynamic ProgrammingGraphShortest Path | 70% | |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | — | Hard | ArrayBreadth-First SearchGraph | 71% | |
| 1514 | Path with Maximum Probability | — | Medium | ArrayGraphHeap (Priority Queue) | 65% | |
| 1786 | Number of Restricted Paths From First to Last Node | — | Medium | Dynamic ProgrammingGraphTopological Sort | 40% | |
| 1976 | Number of Ways to Arrive at Destination | — | Medium | Dynamic ProgrammingGraphTopological Sort | 38% | |
| 2045 | Second Minimum Time to Reach Destination | — | Hard | Breadth-First SearchGraphShortest Path | 63% | |
| 2203 | Minimum Weighted Subgraph With the Required Pathsread | — | Hard | GraphShortest Path | 38% | |
| 2290 | Minimum Obstacle Removal to Reach Corner | — | Hard | ArrayBreadth-First SearchGraph | 70% | |
| 2577 | Minimum Time to Visit a Cell In a Grid | — | Hard | ArrayBreadth-First SearchGraph | 57% | |
| 2642 | Design Graph With Shortest Path Calculator | — | Hard | GraphDesignHeap (Priority Queue) | 64% | |
| 2662 | Minimum Cost of a Path With Special Roadsread | — | Medium | ArrayGraphHeap (Priority Queue) | 40% | |
| 2699 | Modify Graph Edge Weights | — | Hard | GraphHeap (Priority Queue)Shortest Path | 56% | |
| 2959 | Number of Possible Sets of Closing Branches | — | Hard | Bit ManipulationGraphHeap (Priority Queue) | 48% | |
| 2976 | Minimum Cost to Convert String I | — | Medium | ArrayStringGraph | 58% | |
| 2977 | Minimum Cost to Convert String IIread | — | Hard | ArrayStringDynamic Programming | 25% | |
| 3112 | Minimum Time to Visit Disappearing Nodesread | — | Medium | ArrayGraphHeap (Priority Queue) | 35% | |
| 3123 | Find Edges in Shortest Pathsread | — | Hard | Depth-First SearchBreadth-First SearchGraph | 45% | |
| 3286 | Find a Safe Walk Through a Grid | — | Medium | ArrayBreadth-First SearchGraph | 30% | |
| 3341 | Find Minimum Time to Reach Last Room I | — | Medium | ArrayGraphHeap (Priority Queue) | 56% | |
| 3342 | Find Minimum Time to Reach Last Room II | — | Medium | ArrayGraphHeap (Priority Queue) | 69% | |
| 3377 | Digit Operations to Make Two Integers Equal | — | Medium | MathGraphHeap (Priority Queue) | 27% | |
| 3419 | Minimize the Maximum Edge Weight of Graphread | — | Medium | Binary SearchDepth-First SearchBreadth-First Search | 42% | |