| Find the Town Judge | Easy | 50.5% | 100.0% | ArrayHash TableGraph Theory |
| Construct String With Repeat Limit | Medium | 70.9% | 100.0% | Hash TableStringGreedy+2 |
| Reverse Nodes in k-Group | Hard | 65.3% | 87.5% | Linked ListRecursion |
| Reverse Linked List II | Medium | 51.0% | 87.5% | Linked List |
| Restore IP Addresses | Medium | 55.3% | 87.5% | StringBacktracking |
| Reorder List | Medium | 64.6% | 87.5% | Linked ListTwo PointersStack+1 |
| Rotated Digits | Medium | 56.8% | 87.5% | MathDynamic Programming |
| Remove Linked List Elements | Easy | 53.8% | 87.5% | Linked ListRecursion |
| Contains Duplicate II | Easy | 50.8% | 75.0% | ArrayHash TableSliding Window |
| Missing Number | Easy | 71.6% | 75.0% | ArrayHash TableMath+3 |
| Inorder Successor in BST II | Medium | 61.1% | 75.0% | |
| Course Schedule II | Medium | 55.0% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximum Depth of Binary Tree | Easy | 77.9% | 75.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 75.0% | Hash TableLinked List |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 75.0% | Linked ListTwo Pointers |
| Merge Two Sorted Lists | Easy | 67.9% | 62.5% | Linked ListRecursion |
| Missing Element in Sorted Array | Medium | 59.7% | 62.5% | |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| LRU Cache | Medium | 46.8% | 62.5% | Hash TableLinked ListDesign+1 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 62.5% | Hash TableStringDesign+1 |
| Merge In Between Linked Lists | Medium | 82.8% | 62.5% | Linked List |
| Maximum Units on a Truck | Easy | 74.6% | 62.5% | ArrayGreedySorting |
| Kth Largest Element in a Stream | Easy | 60.7% | 62.5% | TreeDesignBinary Search Tree+3 |
| Find the Winner of the Circular Game | Medium | 82.2% | 62.5% | ArrayMathRecursion+2 |
| Palindromic Substrings | Medium | 72.5% | 62.5% | Two PointersStringDynamic Programming |
| Search in Rotated Sorted Array | Medium | 44.1% | 62.5% | ArrayBinary Search |
| Integer to Roman | Medium | 70.4% | 62.5% | Hash TableMathString |
| Path Sum II | Medium | 61.7% | 62.5% | BacktrackingTreeDepth-First Search+1 |
| Search a 2D Matrix | Medium | 53.5% | 62.5% | ArrayBinary SearchMatrix |
| Word Search | Medium | 46.8% | 62.5% | ArrayStringBacktracking+2 |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| Permutations | Medium | 81.6% | 62.5% | ArrayBacktracking |
| Maximum Subarray | Medium | 53.0% | 62.5% | ArrayDivide and ConquerDynamic Programming |
| Simplify Path | Medium | 50.0% | 62.5% | StringStack |
| Word Break | Medium | 49.1% | 62.5% | ArrayHash TableString+3 |
| Remove All Occurrences of a Substring | Medium | 78.4% | 62.5% | StringStackSimulation |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Edit Distance | Medium | 60.1% | 62.5% | StringDynamic Programming |
| Valid Palindrome | Easy | 52.8% | 62.5% | Two PointersString |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |
| Swap Nodes in Pairs | Medium | 68.9% | 62.5% | Linked ListRecursion |