| Largest Number | Medium | 42.6% | 100.0% | ArrayStringGreedy+1 |
| Move Zeroes | Easy | 63.6% | 85.3% | ArrayTwo Pointers |
| Reverse Nodes in Even Length Groups | Medium | 63.7% | 85.3% | Linked List |
| Maximum Twin Sum of a Linked List | Medium | 81.6% | 81.6% | Linked ListTwo PointersStack |
| Spiral Matrix | Medium | 56.2% | 77.3% | ArrayMatrixSimulation |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 72.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Reverse Odd Levels of Binary Tree | Medium | 86.7% | 72.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Delete Leaves With a Given Value | Medium | 77.3% | 72.0% | TreeDepth-First SearchBinary Tree |
| Find Bottom Left Tree Value | Medium | 72.2% | 72.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Merge Nodes in Between Zeros | Medium | 89.7% | 65.2% | Linked ListSimulation |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 65.2% | ArraySliding Window |
| Count Pairs Whose Sum is Less than Target | Easy | 87.7% | 65.2% | ArrayTwo PointersBinary Search+1 |
| Koko Eating Bananas | Medium | 49.7% | 65.2% | ArrayBinary Search |
| Remove K Digits | Medium | 36.4% | 65.2% | StringStackGreedy+1 |
| Invert Binary Tree | Easy | 79.8% | 65.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Daily Temperatures | Medium | 68.4% | 65.2% | ArrayStackMonotonic Stack |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 65.2% | TreeDepth-First SearchBinary Tree |
| Group Anagrams | Medium | 72.2% | 65.2% | ArrayHash TableString+1 |
| Merge Two Sorted Lists | Easy | 68.0% | 65.2% | Linked ListRecursion |
| Sum of Nodes with Even-Valued Grandparent | Medium | 85.9% | 65.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Odd Even Linked List | Medium | 62.3% | 65.2% | Linked List |
| Rotate List | Medium | 41.2% | 65.2% | Linked ListTwo Pointers |
| Reverse Nodes in k-Group | Hard | 65.4% | 65.2% | Linked ListRecursion |
| Merge Two Binary Trees | Easy | 79.0% | 65.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Find the Substring With Maximum Cost | Medium | 57.8% | 55.6% | ArrayHash TableString+1 |
| Largest Rectangle in Histogram | Hard | 49.4% | 55.6% | ArrayStackMonotonic Stack |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 55.6% | Linked ListStackTree+2 |
| Remove Nth Node From End of List | Medium | 51.0% | 55.6% | Linked ListTwo Pointers |
| Palindrome Partitioning II | Hard | 36.6% | 55.6% | StringDynamic Programming |
| Search in Rotated Sorted Array | Medium | 44.1% | 55.6% | ArrayBinary Search |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 55.6% | TreeDepth-First SearchBreadth-First Search+1 |
| Island Perimeter | Easy | 74.3% | 55.6% | ArrayDepth-First SearchBreadth-First Search+1 |
| Climbing Stairs | Easy | 53.9% | 55.6% | MathDynamic ProgrammingMemoization |
| Unique Email Addresses | Easy | 67.8% | 55.6% | ArrayHash TableString |
| Binary Tree Level Order Traversal | Medium | 72.2% | 55.6% | TreeBreadth-First SearchBinary Tree |