| Cheapest Flights Within K Stops | Medium | 41.4% |
| Network Delay Time | Medium | 59.8% |
| Evaluate Division | Medium | 64.0% |
| Minimum Cost to Buy Apples II | Hard | |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% |
| Minimum Cost to Convert String I | Medium | 63.2% |
| Number of Ways to Arrive at Destination | Medium | 37.3% |
| Minimum Cost to Convert String II | Hard | 59.7% |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.2% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.5% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% |
| Path with Maximum Probability | Medium | 65.5% |
| Jump Game VIII | Medium | 45.5% |
| Find Minimum Time to Reach Last Room II | Medium | 67.9% |
| The Maze II | Medium | 55.0% |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% |
| Number of Possible Sets of Closing Branches | Hard | 50.7% |
| Find Minimum Time to Reach Last Room I | Medium | 55.5% |
| Find a Safe Walk Through a Grid | Medium | 32.7% |
| Minimum Cost to Buy Apples | Medium | 67.3% |
| Find Edges in Shortest Paths | Hard | 46.4% |
| Minimum Cost to Reach City With Discounts | Medium | 60.2% |
| Find Shortest Path with K Hops | Hard | 68.7% |
| Minimum Weighted Subgraph With the Required Paths | Hard | 41.1% |
| Minimize the Maximum Edge Weight of Graph | Medium | 44.0% |
| Second Minimum Time to Reach Destination | Hard | 62.4% |
| Number of Restricted Paths From First to Last Node | Medium | 40.9% |
| Modify Graph Edge Weights | Hard | 55.6% |
| Minimum Path Cost in a Hidden Grid | Medium | 58.7% |
| The Maze III | Hard | 52.3% |
| Digit Operations to Make Two Integers Equal | Medium | 29.8% |
| Design Graph With Shortest Path Calculator | Hard | 64.9% |
| Minimum Cost of a Path With Special Roads | Medium | 42.5% |