| 2065 | Maximum Path Quality of a Graph | Hard |
| 2076 | Process Restricted Friend Requests | Hard |
| 2092 | Find All People With Secret | Hard |
| 2097 | Valid Arrangement of Pairs | Hard |
| 2101 | Detonate the Maximum Bombs | Medium |
| 2115 | Find All Possible Recipes from Given Supplies | Medium |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium |
| 2203 | Minimum Weighted Subgraph With the Required Paths | Hard |
| 2242 | Maximum Score of a Node Sequence | Hard |
| 2246 | Longest Path With Different Adjacent Characters | Hard |
| 2285 | Maximum Total Importance of Roads | Medium |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium |
| 2328 | Number of Increasing Paths in a Grid | Hard |
| 2359 | Find Closest Node to Given Two Nodes | Medium |
| 2360 | Longest Cycle in a Graph | Hard |
| 2368 | Reachable Nodes With Restrictions | Medium |
| 2374 | Node With Highest Edge Score | Medium |
| 2392 | Build a Matrix With Conditions | Hard |
| 2467 | Most Profitable Path in a Tree | Medium |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard |
| 2603 | Collect Coins in a Tree | Hard |
| 2608 | Shortest Cycle in a Graph | Hard |
| 2642 | Design Graph With Shortest Path Calculator | Hard |
| 2646 | Minimize the Total Price of the Trips | Hard |
| 2662 | Minimum Cost of a Path With Special Roads | Medium |
| 2685 | Count the Number of Complete Components | Medium |
| 2699 | Modify Graph Edge Weights | Hard |