| Evaluate Division | Medium | 64.0% | 37.5% |
| Network Delay Time | Medium | 59.7% | 37.5% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 37.5% |
| Minimum Weighted Subgraph With the Required Paths | Hard | 41.0% | 37.5% |
| Number of Restricted Paths From First to Last Node | Medium | 40.9% | 25.0% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.4% | 25.0% |
| Path with Maximum Probability | Medium | 65.5% | 25.0% |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.1% | 25.0% |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 25.0% |
| Find Minimum Time to Reach Last Room I | Medium | 55.5% | 25.0% |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 25.0% |
| Minimum Cost to Convert String I | Medium | 63.3% | 12.5% |
| Second Minimum Time to Reach Destination | Hard | 62.4% | 12.5% |
| Modify Graph Edge Weights | Hard | 55.7% | 12.5% |
| Find a Safe Walk Through a Grid | Medium | 32.7% | 12.5% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 12.5% |
| Minimize the Maximum Edge Weight of Graph | Medium | 44.0% | 12.5% |
| Find Minimum Time to Reach Last Room II | Medium | 67.9% | 12.5% |
| Minimum Cost to Convert String II | Hard | 59.7% | 12.5% |