| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Median of Two Sorted Arrays | Hard | 45.9% | 87.5% | ArrayBinary SearchDivide and Conquer |
| Roman to Integer | Easy | 66.2% | 87.5% | Hash TableMathString |
| Maximum Depth of Binary Tree | Easy | 77.9% | 87.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Word Break | Medium | 49.1% | 87.5% | ArrayHash TableString+3 |
| Linked List Cycle | Easy | 53.9% | 87.5% | Hash TableLinked ListTwo Pointers |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Reverse Linked List | Easy | 80.2% | 87.5% | Linked ListRecursion |
| Contains Duplicate | Easy | 64.1% | 87.5% | ArrayHash TableSorting |
| Peeking Iterator | Medium | 61.2% | 87.5% | ArrayDesignIterator |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 87.5% | StringTreeDepth-First Search+3 |
| Largest Palindrome Product | Hard | 38.1% | 87.5% | MathEnumeration |
| Non-decreasing Subsequences | Medium | 62.5% | 87.5% | ArrayHash TableBacktracking+1 |
| Maximum Distance in Arrays | Medium | 45.6% | 87.5% | ArrayGreedy |
| Binary Number with Alternating Bits | Easy | 69.7% | 87.5% | Bit Manipulation |
| Matrix Cells in Distance Order | Easy | 73.9% | 87.5% | ArrayMathGeometry+2 |
| Palindrome Number | Easy | 60.2% | 75.0% | Math |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| 3Sum | Medium | 38.6% | 62.5% | ArrayTwo PointersSorting |
| Merge Sorted Array | Easy | 54.4% | 62.5% | ArrayTwo PointersSorting |
| 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 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 62.5% | ArrayBreadth-First SearchMatrix |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| Valid Parentheses | Easy | 43.7% | 50.0% | StringStack |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Search Insert Position | Easy | 50.7% | 50.0% | ArrayBinary Search |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Group Anagrams | Medium | 72.2% | 50.0% | ArrayHash TableString+1 |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |
| Sqrt(x) | Easy | 41.4% | 50.0% | MathBinary Search |
| Edit Distance | Medium | 60.1% | 50.0% | StringDynamic Programming |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Maximal Rectangle | Hard | 58.1% | 50.0% | ArrayDynamic ProgrammingStack+2 |
| Validate Binary Search Tree | Medium | 35.3% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 50.0% | ArrayDynamic Programming |
| Happy Number | Easy | 59.2% | 50.0% | Hash TableMathTwo Pointers |
| Remove Linked List Elements | Easy | 53.8% | 50.0% | Linked ListRecursion |
| Isomorphic Strings | Easy | 48.0% | 50.0% | Hash TableString |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Valid Anagram | Easy | 67.8% | 50.0% | Hash TableStringSorting |
| Move Zeroes | Easy | 63.5% | 50.0% | ArrayTwo Pointers |
| Intersection of Two Arrays | Easy | 77.5% | 50.0% | ArrayHash TableTwo Pointers+2 |
| Decode String | Medium | 62.2% | 50.0% | StringStackRecursion |
| Longest Repeating Character Replacement | Medium | 59.0% | 50.0% | Hash TableStringSliding Window |
| Find All Duplicates in an Array | Medium | 76.8% | 50.0% | ArrayHash TableSorting |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 50.0% | ArrayGreedySorting |
| Subarray Sum Equals K | Medium | 46.8% | 50.0% | ArrayHash TablePrefix Sum |
| Network Delay Time | Medium | 59.7% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Squares of a Sorted Array | Easy | 73.6% | 50.0% | ArrayTwo PointersSorting |
| Subarrays with K Different Integers | Hard | 67.5% | 50.0% | ArrayHash TableSliding Window+1 |
| Maximum Number of Occurrences of a Substring | Medium | 54.2% | 50.0% | Hash TableStringSliding Window |
| Make The String Great | Easy | 68.4% | 50.0% | StringStack |
| Number of Students Unable to Eat Lunch | Easy | 79.3% | 50.0% | ArrayStackQueue+1 |
| Recyclable and Low Fat Products | Easy | 88.8% | 50.0% | Database |
| Concatenation of Array | Easy | 90.5% | 50.0% | ArraySimulation |
| Restore IP Addresses | Medium | 55.3% | 50.0% | StringBacktracking |
| Evaluate Division | Medium | 64.0% | 50.0% | ArrayStringDepth-First Search+4 |
| Flatten Nested List Iterator | Medium | 65.6% | 50.0% | StackTreeDepth-First Search+3 |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |