| Operations on Tree | Medium | 45.0% | 100.0% | ArrayHash TableTree+3 |
| Longest Cycle in a Graph | Hard | 50.4% | 87.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 87.5% | Depth-First SearchGraph Theory |
| Node With Highest Edge Score | Medium | 49.2% | 87.5% | Hash TableGraph Theory |
| Longest Subsequence With Decreasing Adjacent Difference | Medium | 16.6% | 87.5% | ArrayDynamic Programming |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Largest Color Value in a Directed Graph | Hard | 57.4% | 50.0% | Hash TableStringDynamic Programming+4 |
| Shortest Path in a Weighted Tree | Hard | 42.1% | 50.0% | ArrayTreeDepth-First Search+2 |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Maximum Score From Removing Substrings | Medium | 66.6% | 50.0% | StringStackGreedy |
| Gas Station | Medium | 47.5% | 50.0% | ArrayGreedy |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Merge Intervals | Medium | 51.1% | 50.0% | ArraySorting |