| 1617 | Count Subtrees With Max Distance Between Cities | Hard | dynamic programming |
| 2359 | Find Closest Node to Given Two Nodes | Medium | graph |
| 2360 | Longest Cycle in a Graph | Hard | graph |
| 2392 | Build a Matrix With Conditions | Hard | graph |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard | graph |
| 2608 | Shortest Cycle in a Graph | Hard | graph |
| 2662 | Minimum Cost of a Path With Special Roads | Medium | graph |
| 2714 | Find Shortest Path with K Hops | Hard | graph |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard | graph |
| 2876 | Count Visited Nodes in a Directed Graph | Hard | graph |
| 2924 | Find Champion II | Medium | graph |
| 2959 | Number of Possible Sets of Closing Branches | Medium | graph |
| 3235 | Check if the Rectangle Corner Is Reachable | Hard | graph |
| 3243 | Shortest Distance After Road Addition Queries I | Medium | graph |
| 3244 | Shortest Distance After Road Addition Queries II | Hard | graph |
| 3265 | Count Almost Equal Pairs I | Medium | graph |
| 3267 | Count Almost Equal Pairs II | Hard | graph |
| 3310 | Remove Methods From Project | Medium | graph |
| 3311 | Construct 2D Grid Matching Graph Layout | Hard | constructive algorithms |
| 3341 | Find Minimum Time to Reach Last Room I | Medium | graph |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | graph |
| 3376 | Minimum Time to Break Locks I | Medium | graph |
| 3377 | Digit Operations to Make Two Integers Equal | Medium | graph |
| 3378 | Count Connected Components in LCM Graph | Hard | graph |
| 3383 | Minimum Runes to Add to Cast Spell | Hard | graph |
| 3385 | Minimum Time to Break Locks II | Hard | graph |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | graph |
| 3435 | Frequencies of Shortest Supersequences | Hard | graph |
| 3481 | Apply Substitutions | Medium | graph |
| 3493 | Properties Graph | Medium | graph |
| 3594 | Minimum Time to Transport All Individuals | Hard | graph |
| 3604 | Minimum Time to Reach Destination in Directed Graph | Medium | graph |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | graph |
| 3656 | Determine if a Simple Graph Exists | Medium | graph |
| 3660 | Jump Game IX | Medium | graph |
| 3710 | Maximum Partition Factor | Hard | graph |
| 3778 | Minimum Distance Excluding One Maximum Weighted Edge | Medium | graph |
| 3873 | Maximum Points Activated with One Addition | Hard | graph |
| 3887 | Incremental Even-Weighted Cycle Queries | Hard | graph |
| 3910 | Count Connected Subgraphs with Even Node Sum | Hard | graph |
| 3928 | Minimum Cost to Buy Apples II | Hard | graph |
| 3970 | Shortest Path With At Most K Consecutive Identical Characters | Medium | graph |
| 3977 | Minimum Time to Reach Target With Limited Power | Hard | graph |