| Parallel Courses III | Hard | 66.8% |
| Longest Increasing Path in a Matrix | Hard | 56.3% |
| Course Schedule | Medium | 50.8% |
| Reconstruct Itinerary | Hard | 44.3% |
| Design Excel Sum Formula | Hard | 39.9% |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% |
| Detonate the Maximum Bombs | Medium | 49.9% |
| Alien Dictionary | Hard | 37.1% |
| Cheapest Flights Within K Stops | Medium | 41.4% |
| Number of Operations to Make Network Connected | Medium | 66.2% |
| Course Schedule II | Medium | 55.0% |
| Clone Graph | Medium | 64.7% |
| Evaluate Division | Medium | 64.0% |
| Minimum Height Trees | Medium | 42.4% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% |
| Redundant Connection | Medium | 67.3% |
| Is Graph Bipartite? | Medium | 58.9% |
| 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% |
| 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% |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% |
| Most Profitable Path in a Tree | Medium | 67.3% |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.3% |
| Graph Valid Tree | Medium | 49.8% |
| Longest Cycle in a Graph | Hard | 50.5% |
| Sum of Distances in Tree | Hard | 65.5% |
| Longest Path With Different Adjacent Characters | Hard | 54.0% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% |
| Largest Color Value in a Directed Graph | Hard | 57.3% |
| Collect Coins in a Tree | Hard | 39.7% |
| Number of Possible Sets of Closing Branches | Hard | 50.7% |
| Couples Holding Hands | Hard | 59.2% |
| Rank Transform of a Matrix | Hard | 42.1% |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 52.1% |
| Minimum Cost to Buy Apples | Medium | 67.3% |
| Reachable Nodes With Restrictions | Medium | 60.2% |
| Add Edges to Make Degrees of All Nodes Even | Hard | 35.2% |
| Maximum Total Importance of Roads | Medium | 69.1% |
| Minimum Time to Break Locks II | Hard | 45.2% |
| Node With Highest Edge Score | Medium | 49.2% |
| Frequencies of Shortest Supersequences | Hard | 22.0% |
