| Operations on Tree | Medium | 45.0% | 100.0% | ArrayHash TableTree+3 |
| Longest Cycle in a Graph | Hard | 50.5% | 100.0% | Depth-First SearchBreadth-First SearchGraph+1 |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 95.8% | Depth-First SearchGraph |
| Node With Highest Edge Score | Medium | 49.2% | 90.6% | Hash TableGraph |
| Longest Subsequence With Decreasing Adjacent Difference | Medium | 16.6% | 88.5% | ArrayDynamic Programming |
| Set Matrix Zeroes | Medium | 62.5% | 68.8% | ArrayHash TableMatrix |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 62.6% | Hash TableDynamic ProgrammingGraph+3 |
| Shortest Path in a Weighted Tree | Hard | 42.1% | 62.6% | ArrayTreeDepth-First Search+2 |
| Sliding Window Maximum | Hard | 48.5% | 62.6% | ArrayQueueSliding Window+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.6% | Hash TableStringSliding Window |
| Word Ladder | Hard | 44.9% | 53.9% | Hash TableStringBreadth-First Search |