| 133 | Clone Graph | Medium |
| 207 | Course Schedule | Medium |
| 310 | Minimum Height Trees | Medium |
| 329 | Longest Increasing Path in a Matrix | Hard |
| 332 | Reconstruct Itinerary | Hard |
| 399 | Evaluate Division | Medium |
| 684 | Redundant Connection | Medium |
| 685 | Redundant Connection II | Hard |
| 743 | Network Delay Time | Medium |
| 753 | Cracking the Safe | Hard |
| 765 | Couples Holding Hands | Hard |
| 785 | Is Graph Bipartite? | Medium |
| 787 | Cheapest Flights Within K Stops | Medium |
| 797 | All Paths From Source to Target | Medium |
| 802 | Find Eventual Safe States | Medium |
| 834 | Sum of Distances in Tree | Hard |
| 841 | Keys and Rooms | Medium |
| 851 | Loud and Rich | Medium |
| 877 | Shortest Path Visiting All Nodes | Hard |
| 882 | Reachable Nodes In Subdivided Graph | Hard |
| 886 | Possible Bipartition | Medium |
| 913 | Cat and Mouse | Hard |
| 947 | Most Stones Removed with Same Row or Column | Medium |
| 959 | Regions Cut By Slashes | Medium |
| 990 | Satisfiability of Equality Equations | Medium |
| 997 | Find the Town Judge | Easy |
| 1042 | Flower Planting With No Adjacent | Medium |
| 1129 | Shortest Path with Alternating Colors | Medium |
| 1192 | Critical Connections in a Network | Hard |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard |