| String Compression III | Medium | 67.0% | 100.0% | String |
| Maximum Number of Ones | Hard | 70.5% | 97.5% | MathGreedySorting+1 |
| Reverse Nodes in k-Group | Hard | 65.4% | 91.7% | Linked ListRecursion |
| Number of Islands | Medium | 63.8% | 88.2% | ArrayDepth-First SearchBreadth-First Search+2 |
| LRU Cache | Medium | 46.8% | 84.2% | Hash TableLinked ListDesign+1 |
| Two Sum | Easy | 57.1% | 84.2% | ArrayHash Table |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 84.2% | Hash TableStringSliding Window |
| Reverse Linked List | Easy | 80.3% | 84.2% | Linked ListRecursion |
| Valid Parentheses | Easy | 43.7% | 79.4% | StringStack |
| Palindrome Number | Easy | 60.3% | 73.6% | Math |
| Remove Nth Node From End of List | Medium | 51.0% | 73.6% | Linked ListTwo Pointers |
| Reverse Bits | Easy | 67.8% | 73.6% | Divide and ConquerBit Manipulation |
| 3Sum | Medium | 38.6% | 73.6% | ArrayTwo PointersSorting |
| Rotate Image | Medium | 79.4% | 73.6% | ArrayMathMatrix |
| Power of Two | Easy | 49.9% | 73.6% | MathBit ManipulationRecursion |
| Rectangle Overlap | Easy | 46.5% | 73.6% | MathGeometry |
| Linked List Cycle | Easy | 53.9% | 73.6% | Hash TableLinked ListTwo Pointers |
| Reverse String | Easy | 80.6% | 73.6% | Two PointersString |
| Middle of the Linked List | Easy | 81.6% | 66.1% | Linked ListTwo Pointers |
| Pow(x, n) | Medium | 38.3% | 66.1% | MathRecursion |
| Design Circular Queue | Medium | 54.0% | 66.1% | ArrayLinked ListDesign+1 |
| Count Array Pairs Divisible by K | Hard | 30.6% | 66.1% | ArrayHash TableMath+2 |
| Move Zeroes | Easy | 63.6% | 66.1% | ArrayTwo Pointers |
| Climbing Stairs | Easy | 53.9% | 66.1% | MathDynamic ProgrammingMemoization |
| String to Integer (atoi) | Medium | 20.6% | 66.1% | String |
| Implement Queue using Stacks | Easy | 69.4% | 66.1% | StackDesignQueue |
| Majority Element | Easy | 66.1% | 66.1% | ArrayHash TableDivide and Conquer+2 |
| Count the Number of Fair Pairs | Medium | 52.7% | 66.1% | ArrayTwo PointersBinary Search+1 |
| Trapping Rain Water | Hard | 66.8% | 66.1% | ArrayTwo PointersDynamic Programming+2 |
| Last Substring in Lexicographical Order | Hard | 35.0% | 55.7% | Two PointersString |
| Peak Index in a Mountain Array | Medium | 66.9% | 55.7% | ArrayBinary Search |
| Unique Paths | Medium | 66.6% | 55.7% | MathDynamic ProgrammingCombinatorics |
| Swap Nodes in Pairs | Medium | 69.0% | 55.7% | Linked ListRecursion |
| Design Memory Allocator | Medium | 49.7% | 55.7% | ArrayHash TableDesign+1 |
| Is Subsequence | Easy | 48.9% | 55.7% | Two PointersStringDynamic Programming |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 55.7% | ArrayTwo Pointers |
| Length of Last Word | Easy | 58.3% | 55.7% | String |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 55.7% | StringTreeDepth-First Search+3 |
| Merge Intervals | Medium | 51.2% | 55.7% | ArraySorting |
| Trapping Rain Water II | Hard | 64.0% | 55.7% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 55.7% | ArrayDivide and ConquerSorting+2 |
| Maximum Depth of Binary Tree | Easy | 77.9% | 55.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Reverse Integer | Medium | 31.5% | 55.7% | Math |
| Course Schedule II | Medium | 55.0% | 55.7% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Permutations | Medium | 81.7% | 55.7% | ArrayBacktracking |
| Power of Four | Easy | 51.8% | 55.7% | MathBit ManipulationRecursion |
| Merge Sorted Array | Easy | 54.4% | 55.7% | ArrayTwo PointersSorting |
| Median of Two Sorted Arrays | Hard | 46.0% | 55.7% | ArrayBinary SearchDivide and Conquer |
| Subarray Sum Equals K | Medium | 46.8% | 55.7% | ArrayHash TablePrefix Sum |
| Edit Distance | Medium | 60.2% | 55.7% | StringDynamic Programming |
| Maximum Product Subarray | Medium | 36.0% | 55.7% | ArrayDynamic Programming |
| Find the Index of the First Occurrence in a String | Easy | 46.3% | 55.7% | Two PointersStringString Matching |
| Moving Average from Data Stream | Easy | 80.2% | 55.7% | ArrayDesignQueue+1 |
| Generate Parentheses | Medium | 78.3% | 55.7% | StringDynamic ProgrammingBacktracking |
| Single Number | Easy | 77.4% | 55.7% | ArrayBit Manipulation |
| Implement Stack using Queues | Easy | 69.4% | 55.7% | StackDesignQueue |
| Merge k Sorted Lists | Hard | 58.9% | 55.7% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Container With Most Water | Medium | 59.6% | 55.7% | ArrayTwo PointersGreedy |
| Merge Two Sorted Lists | Easy | 68.0% | 55.7% | Linked ListRecursion |
| Longest Common Prefix | Easy | 47.1% | 55.7% | ArrayStringTrie |
| Counting Bits | Easy | 80.4% | 55.7% | Dynamic ProgrammingBit Manipulation |
| Number of 1 Bits | Easy | 76.4% | 55.7% | Divide and ConquerBit Manipulation |