| Construct String With Repeat Limit | Medium | 70.9% | 100.0% | Hash TableStringGreedy+2 |
| Find the Town Judge | Easy | 50.5% | 97.6% | ArrayHash TableGraph Theory |
| Reverse Nodes in k-Group | Hard | 65.4% | 91.9% | Linked ListRecursion |
| Restore IP Addresses | Medium | 55.3% | 91.9% | StringBacktracking |
| Reorder List | Medium | 64.6% | 84.6% | Linked ListTwo PointersStack+1 |
| Course Schedule II | Medium | 55.0% | 80.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Reverse Linked List II | Medium | 51.0% | 80.0% | Linked List |
| Remove Linked List Elements | Easy | 53.9% | 80.0% | Linked ListRecursion |
| Contains Duplicate II | Easy | 50.8% | 74.3% | ArrayHash TableSliding Window |
| Inorder Successor in BST II | Medium | 61.1% | 74.3% | TreeBinary Search TreeBinary Tree |
| Maximum Depth of Binary Tree | Easy | 77.9% | 74.3% | TreeDepth-First SearchBreadth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 74.3% | Hash TableLinked List |
| Missing Number | Easy | 71.7% | 74.3% | ArrayHash TableMath+3 |
| LRU Cache | Medium | 46.8% | 74.3% | Hash TableLinked ListDesign+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 74.3% | ArrayBinary Search |
| Rotated Digits | Medium | 56.8% | 67.0% | MathDynamic Programming |
| Maximum Units on a Truck | Easy | 74.7% | 67.0% | ArrayGreedySorting |
| Simplify Path | Medium | 50.0% | 67.0% | StringStack |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 67.0% | Linked ListTwo Pointers |
| Permutations | Medium | 81.7% | 67.0% | ArrayBacktracking |
| Merge In Between Linked Lists | Medium | 82.9% | 56.8% | Linked List |
| Palindromic Substrings | Medium | 72.6% | 56.8% | Two PointersStringDynamic Programming |
| Path Sum II | Medium | 61.8% | 56.8% | BacktrackingTreeDepth-First Search+1 |
| Longest Palindromic Substring | Medium | 37.4% | 56.8% | Two PointersStringDynamic Programming |
| Word Search | Medium | 46.9% | 56.8% | ArrayStringBacktracking+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 56.8% | Hash TableStringSliding Window |
| Remove All Occurrences of a Substring | Medium | 78.4% | 56.8% | StringStackSimulation |
| Maximum Subarray | Medium | 53.0% | 56.8% | ArrayDivide and ConquerDynamic Programming |
| Swap Nodes in Pairs | Medium | 69.0% | 56.8% | Linked ListRecursion |
| Word Break | Medium | 49.1% | 56.8% | ArrayHash TableString+3 |
| Top K Frequent Elements | Medium | 65.9% | 56.8% | ArrayHash TableDivide and Conquer+5 |
| Edit Distance | Medium | 60.2% | 56.8% | StringDynamic Programming |
| Kth Largest Element in a Stream | Easy | 60.7% | 56.8% | TreeDesignBinary Search Tree+3 |
| Valid Palindrome | Easy | 52.8% | 56.8% | Two PointersString |
| Decode String | Medium | 62.3% | 56.8% | StringStackRecursion |
| Count Negative Numbers in a Sorted Matrix | Easy | 79.5% | 56.8% | ArrayBinary SearchMatrix |
| Moving Average from Data Stream | Easy | 80.2% | 56.8% | ArrayDesignQueue+1 |
| Implement Queue using Stacks | Easy | 69.4% | 56.8% | StackDesignQueue |
| Merge Two Sorted Lists | Easy | 68.0% | 56.8% | Linked ListRecursion |