| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% |
| Parallel Courses III | Hard | 66.8% |
| Number of Provinces | Medium | 70.0% |
| Number of Increasing Paths in a Grid | Hard | 57.4% |
| Longest Increasing Path in a Matrix | Hard | 56.3% |
| Unit Conversion I | Medium | 54.3% |
| Course Schedule | Medium | 50.8% |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.1% |
| Reconstruct Itinerary | Hard | 44.3% |
| Find Diameter Endpoints of a Tree | Medium | 69.8% |
| Design Excel Sum Formula | Hard | 39.9% |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% |
| Detonate the Maximum Bombs | Medium | 49.9% |
| Minimum Cost to Reach Destination in Time | Hard | 41.2% |
| Alien Dictionary | Hard | 37.1% |
| Cheapest Flights Within K Stops | Medium | 41.4% |
| Minimum Number of Vertices to Reach All Nodes | Medium | 81.5% |
| Maximum Star Sum of a Graph | Medium | 42.0% |
| Number of Operations to Make Network Connected | Medium | 66.2% |
| Network Delay Time | Medium | 59.8% |
| Critical Connections in a Network | Hard | 59.3% |
| Course Schedule II | Medium | 55.0% |
| Clone Graph | Medium | 64.7% |
| Evaluate Division | Medium | 64.0% |
| Find if Path Exists in Graph | Easy | 54.8% |
| Find Center of Star Graph | Easy | 86.6% |
| Minimum Cost to Buy Apples II | Hard | |
| Parallel Courses II | Hard | 30.6% |
| Minimum Height Trees | Medium | 42.4% |
| Min Cost to Connect All Points | Medium | 70.4% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% |
| Find Eventual Safe States | Medium | 70.3% |
| All Paths From Source to Target | Medium | 83.5% |
| Satisfiability of Equality Equations | Medium | 51.6% |
| Redundant Connection | Medium | 67.3% |
| Is Graph Bipartite? | Medium | 58.9% |
| Minimum Cost to Convert String I | Medium | 63.2% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% |
| Possible Bipartition | Medium | 52.4% |
| Find Closest Node to Given Two Nodes | Medium | 53.0% |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.9% |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% |
| Find the Celebrity | Medium | 48.9% |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% |
| Keys and Rooms | Medium | 75.5% |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% |
| Find the Town Judge | Easy | 50.5% |
| Course Schedule IV | Medium | 59.7% |
| Number of Ways to Arrive at Destination | Medium | 37.3% |
| Shortest Path with Alternating Colors | Medium | 47.7% |
| Count the Number of Complete Components | Medium | 77.8% |
| Loud and Rich | Medium | 63.2% |
| 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% |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% |
| Tree Diameter | Medium | 61.3% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% |
| Check for Contradictions in Equations | Hard | 43.8% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.5% |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% |
| Most Profitable Path in a Tree | Medium | 67.3% |
| Shortest Path Visiting All Nodes | Hard | 65.8% |
| Connecting Cities With Minimum Cost | Medium | 63.4% |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.3% |
| Get Watched Videos by Your Friends | Medium | 52.1% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% |
| Graph Valid Tree | Medium | 49.8% |
| Parallel Courses | Medium | 62.1% |
| Longest Cycle in a Graph | Hard | 50.5% |
| Power Grid Maintenance | Medium | 56.3% |
| Sum of Distances in Tree | Hard | 65.5% |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% |
| Longest Path With Different Adjacent Characters | Hard | 54.0% |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% |
| Path with Maximum Probability | Medium | 65.5% |
| Valid Arrangement of Pairs | Hard | 66.5% |
| Jump Game VIII | Medium | 45.5% |
| Minimum Operations to Remove Adjacent Ones in Matrix | Hard | 42.9% |
| Count Pairs Of Nodes | Hard | 42.5% |
| Minimum Score of a Path Between Two Cities | Medium | 58.6% |
| Find Minimum Time to Reach Last Room II | Medium | 67.9% |
| Minimize Malware Spread | Hard | 43.0% |
| The Maze II | Medium | 55.0% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% |
| Sequence Reconstruction | Medium | 30.5% |
| Number of Good Paths | Hard | 56.3% |
| Minimum Time for K Connected Components | Medium | 45.2% |
| Shortest Distance After Road Addition Queries I | Medium | 61.9% |
| Find All People With Secret | Hard | 48.4% |
| Maximize Spanning Tree Stability with Upgrades | Hard | |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% |
| The Time When the Network Becomes Idle | Medium | 55.3% |
| Properties Graph | Medium | |
| Largest Color Value in a Directed Graph | Hard | 57.3% |
| Collect Coins in a Tree | Hard | 39.7% |
| Maximum Path Quality of a Graph | Hard | 61.7% |
| Optimize Water Distribution in a Village | Hard | 65.5% |
| Minimize Maximum Component Cost | Medium | 43.4% |