| Special Binary String | Hard | 75.9% | 100.0% | StringDivide and ConquerSorting |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Last Stone Weight | Easy | 66.3% | 87.5% | ArrayHeap (Priority Queue) |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 87.5% | ArrayDynamic Programming |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 75.0% | ArrayBinary Search |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Maximum Subarray | Medium | 53.0% | 75.0% | ArrayDivide and ConquerDynamic Programming |
| Reverse Bits | Easy | 67.7% | 75.0% | Divide and ConquerBit Manipulation |
| Number of Islands | Medium | 63.8% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Move Zeroes | Easy | 63.5% | 75.0% | ArrayTwo Pointers |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% | 75.0% | Dynamic ProgrammingGreedyBit Manipulation |
| Maximum Number of Visible Points | Hard | 37.9% | 75.0% | ArrayMathGeometry+2 |
| Task Scheduler II | Medium | 54.7% | 75.0% | ArrayHash TableSimulation |
| Fizz Buzz | Easy | 75.2% | 75.0% | MathStringSimulation |
| Maximize Greatness of an Array | Medium | 61.2% | 75.0% | ArrayTwo PointersGreedy+1 |
| Add Two Numbers | Medium | 47.9% | 62.5% | Linked ListMathRecursion |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Break a Palindrome | Medium | 51.6% | 62.5% | StringGreedy |
| Missing Number | Easy | 71.6% | 62.5% | ArrayHash TableMath+3 |
| Find the Duplicate Number | Medium | 64.0% | 62.5% | ArrayTwo PointersBinary Search+1 |
| Find Median from Data Stream | Hard | 54.2% | 62.5% | Two PointersDesignSorting+2 |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 62.5% | |
| Fibonacci Number | Easy | 73.9% | 62.5% | MathDynamic ProgrammingRecursion+1 |
| String to Integer (atoi) | Medium | 20.6% | 62.5% | String |
| Reverse Linked List | Easy | 80.2% | 62.5% | Linked ListRecursion |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 62.5% | StringTreeDepth-First Search+3 |
| Reverse Words in a String | Medium | 55.5% | 62.5% | Two PointersString |
| Sort Colors | Medium | 69.1% | 62.5% | ArrayTwo PointersSorting |
| Unique Paths II | Medium | 44.1% | 62.5% | ArrayDynamic ProgrammingMatrix |
| 4Sum | Medium | 40.0% | 62.5% | ArrayTwo PointersSorting |
| Restore IP Addresses | Medium | 55.3% | 62.5% | StringBacktracking |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 62.5% | ArrayHash TableSorting+1 |
| Rotate List | Medium | 41.2% | 62.5% | Linked ListTwo Pointers |
| Container With Most Water | Medium | 59.5% | 62.5% | ArrayTwo PointersGreedy |
| Find The Original Array of Prefix Xor | Medium | 88.3% | 62.5% | ArrayBit Manipulation |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Reverse Linked List II | Medium | 51.0% | 50.0% | Linked List |
| Validate Binary Search Tree | Medium | 35.3% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 50.0% | Hash TableLinked List |
| Max Points on a Line | Hard | 30.2% | 50.0% | ArrayHash TableMath+1 |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |
| House Robber | Medium | 52.9% | 50.0% | ArrayDynamic Programming |
| Maximal Square | Medium | 50.0% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Counting Bits | Easy | 80.4% | 50.0% | Dynamic ProgrammingBit Manipulation |
| Linked List Random Node | Medium | 64.6% | 50.0% | Linked ListMathReservoir Sampling+1 |
| Find Pivot Index | Easy | 62.1% | 50.0% | ArrayPrefix Sum |
| Sliding Puzzle | Hard | 74.1% | 50.0% | ArrayDynamic ProgrammingBacktracking+3 |
| Design HashMap | Easy | 66.4% | 50.0% | ArrayHash TableLinked List+2 |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 50.0% | ArrayHash TableSliding Window |
| Rectangle Area | Medium | 48.9% | 50.0% | MathGeometry |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Longest Common Prefix | Easy | 47.1% | 50.0% | ArrayStringTrie |
| Minimum Size Subarray Sum | Medium | 51.0% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |
| Merge Sorted Array | Easy | 54.4% | 50.0% | ArrayTwo PointersSorting |
| Remove Duplicates from Sorted List | Easy | 56.2% | 50.0% | Linked List |
| Course Schedule II | Medium | 55.0% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Delete Duplicate Folders in System | Hard | 77.7% | 50.0% | ArrayHash TableString+2 |
| Number of 1 Bits | Easy | 76.3% | 50.0% | Divide and ConquerBit Manipulation |
| Remove Stones to Minimize the Total | Medium | 65.5% | 50.0% | ArrayGreedyHeap (Priority Queue) |
| Minimum Path Sum | Medium | 67.8% | 50.0% | ArrayDynamic ProgrammingMatrix |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Power of Two | Easy | 49.8% | 50.0% | MathBit ManipulationRecursion |
| Subarray Sum Equals K | Medium | 46.8% | 50.0% | ArrayHash TablePrefix Sum |
| Valid Anagram | Easy | 67.8% | 50.0% | Hash TableStringSorting |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 50.0% | ArrayGreedySorting+1 |
| Top K Frequent Elements | Medium | 65.8% | 50.0% | ArrayHash TableDivide and Conquer+5 |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Find the Celebrity | Medium | 48.9% | 50.0% | |
| Course Schedule | Medium | 50.8% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Absolute Difference | Easy | 75.0% | 50.0% | ArraySorting |
| Reverse Integer | Medium | 31.5% | 37.5% | Math |
| 3Sum | Medium | 38.6% | 37.5% | ArrayTwo PointersSorting |
| Climbing Stairs | Easy | 53.9% | 37.5% | MathDynamic ProgrammingMemoization |
| Robot Bounded In Circle | Medium | 56.4% | 37.5% | MathStringSimulation |
| Minimum Knight Moves | Medium | 41.7% | 37.5% | |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 37.5% | Hash TableStringDesign+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 37.5% | ArrayDivide and ConquerSorting+2 |
| Snapshot Array | Medium | 36.7% | 37.5% | ArrayHash TableBinary Search+1 |
| Delete Node in a Linked List | Medium | 83.6% | 37.5% | Linked List |
| Verify Preorder Sequence in Binary Search Tree | Medium | 51.7% | 37.5% | |
| H-Index | Medium | 41.1% | 37.5% | ArraySortingCounting Sort |
| Intersection of Two Arrays | Easy | 77.5% | 37.5% | ArrayHash TableTwo Pointers+2 |
| Subarray Product Less Than K | Medium | 53.9% | 37.5% | ArrayBinary SearchSliding Window+1 |
| All Possible Full Binary Trees | Medium | 82.8% | 37.5% | Dynamic ProgrammingTreeRecursion+2 |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% | 37.5% | |
| Coin Change | Medium | 47.9% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Keys and Rooms | Medium | 75.5% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Validate IP Address | Medium | 28.2% | 37.5% | String |
| Count the Number of Good Subsequences | Medium | 48.3% | 37.5% | |
| Reverse String | Easy | 80.5% | 37.5% | Two PointersString |
| Merge In Between Linked Lists | Medium | 82.8% | 37.5% | Linked List |
| The Maze | Medium | 60.3% | 37.5% | |
| Reverse Only Letters | Easy | 68.1% | 37.5% | Two PointersString |
| Integer to English Words | Hard | 34.8% | 37.5% | MathStringRecursion |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 37.5% | Linked ListTwo Pointers |
| Linked List Cycle | Easy | 53.9% | 37.5% | Hash TableLinked ListTwo Pointers |
| Largest Number | Medium | 42.6% | 37.5% | ArrayStringGreedy+1 |
| Clone Graph | Medium | 64.7% | 37.5% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Daily Temperatures | Medium | 68.3% | 37.5% | ArrayStackMonotonic Stack |
| Middle of the Linked List | Easy | 81.5% | 37.5% | Linked ListTwo Pointers |
| Merge Two Sorted Lists | Easy | 67.9% | 37.5% | Linked ListRecursion |
| First Unique Character in a String | Easy | 65.0% | 37.5% | Hash TableStringQueue+1 |
| Reorder List | Medium | 64.6% | 37.5% | Linked ListTwo PointersStack+1 |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 37.5% | ArrayQueueSliding Window+3 |
| Number of Ways to Split Array | Medium | 55.9% | 37.5% | ArrayPrefix Sum |
| Pow(x, n) | Medium | 38.2% | 37.5% | MathRecursion |
| Is Subsequence | Easy | 48.8% | 37.5% | Two PointersStringDynamic Programming |
| Find the Winner of an Array Game | Medium | 56.8% | 37.5% | ArraySimulation |
| Maximum Product of Three Numbers | Easy | 45.7% | 37.5% | ArrayMathSorting |
| Sqrt(x) | Easy | 41.4% | 37.5% | MathBinary Search |
| Longest Increasing Subsequence | Medium | 59.0% | 37.5% | ArrayBinary SearchDynamic Programming |
| Design Memory Allocator | Medium | 49.7% | 37.5% | ArrayHash TableDesign+1 |
| Unique Paths | Medium | 66.5% | 37.5% | MathDynamic ProgrammingCombinatorics |
| Simplify Path | Medium | 50.0% | 37.5% | StringStack |
| Word Pattern | Easy | 43.8% | 37.5% | Hash TableString |
| The Skyline Problem | Hard | 45.0% | 37.5% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Find K Closest Elements | Medium | 49.4% | 37.5% | ArrayTwo PointersBinary Search+3 |
| Min Stack | Medium | 57.7% | 37.5% | StackDesign |
| Third Maximum Number | Easy | 38.8% | 37.5% | ArraySorting |
| Decode String | Medium | 62.2% | 37.5% | StringStackRecursion |
| Median of Two Sorted Arrays | Hard | 45.9% | 37.5% | ArrayBinary SearchDivide and Conquer |
| Number of Lines To Write String | Easy | 72.1% | 37.5% | ArrayString |