| Special Binary String | Hard | 79.3% | 100.0% | StringDivide and ConquerSorting |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 85.0% | Hash TableStringSliding Window |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 82.1% | ArrayDynamic Programming |
| Two Sum | Easy | 57.1% | 80.6% | ArrayHash Table |
| Merge k Sorted Lists | Hard | 58.9% | 78.9% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Group Anagrams | Medium | 72.2% | 77.1% | ArrayHash TableString+1 |
| Valid Parentheses | Easy | 43.7% | 77.1% | StringStack |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 77.1% | Dynamic ProgrammingGreedyBit Manipulation |
| Last Stone Weight | Easy | 66.3% | 75.1% | ArrayHeap (Priority Queue) |
| Maximum Subarray | Medium | 53.0% | 75.1% | ArrayDivide and ConquerDynamic Programming |
| Maximize Greatness of an Array | Medium | 61.3% | 75.1% | ArrayTwo PointersGreedy+1 |
| Number of Islands | Medium | 63.8% | 73.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Number of Visible Points | Hard | 38.0% | 73.0% | ArrayMathGeometry+2 |
| Restore IP Addresses | Medium | 55.3% | 70.6% | StringBacktracking |
| Search in Rotated Sorted Array | Medium | 44.1% | 70.6% | ArrayBinary Search |
| Fizz Buzz | Easy | 75.3% | 70.6% | MathStringSimulation |
| Trapping Rain Water | Hard | 66.8% | 67.9% | ArrayTwo PointersDynamic Programming+2 |
| Reverse Bits | Easy | 67.8% | 67.9% | Divide and ConquerBit Manipulation |
| Missing Number | Easy | 71.7% | 64.9% | ArrayHash TableMath+3 |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 64.9% | ArrayHash TableTwo Pointers+1 |
| Task Scheduler II | Medium | 54.7% | 64.9% | ArrayHash TableSimulation |
| Find the Duplicate Number | Medium | 64.0% | 61.4% | ArrayTwo PointersBinary Search+1 |
| Move Zeroes | Easy | 63.6% | 61.4% | ArrayTwo Pointers |
| Reverse Words in a String | Medium | 55.6% | 61.4% | Two PointersString |
| Rotate List | Medium | 41.2% | 61.4% | Linked ListTwo Pointers |
| Container With Most Water | Medium | 59.6% | 61.4% | ArrayTwo PointersGreedy |
| Find The Original Array of Prefix Xor | Medium | 88.3% | 61.4% | ArrayBit Manipulation |
| Merge Intervals | Medium | 51.2% | 61.4% | ArraySorting |
| 4Sum | Medium | 40.0% | 61.4% | ArrayTwo PointersSorting |
| Sliding Window Maximum | Hard | 48.5% | 57.3% | ArrayQueueSliding Window+2 |
| Merge Sorted Array | Easy | 54.4% | 57.3% | ArrayTwo PointersSorting |
| Top K Frequent Elements | Medium | 65.9% | 57.3% | ArrayHash TableDivide and Conquer+5 |
| Add Two Numbers | Medium | 48.0% | 57.3% | Linked ListMathRecursion |
| Fibonacci Number | Easy | 73.9% | 57.3% | MathDynamic ProgrammingRecursion+1 |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 57.3% | ArrayHash TableSorting+1 |
| Reverse Linked List | Easy | 80.3% | 57.3% | Linked ListRecursion |
| Unique Paths II | Medium | 44.2% | 57.3% | ArrayDynamic ProgrammingMatrix |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 57.3% | ArrayHash TableMath+2 |
| House Robber | Medium | 52.9% | 52.3% | ArrayDynamic Programming |
| Minimum Absolute Difference | Easy | 75.0% | 52.3% | ArraySorting |
| Rotate Image | Medium | 79.4% | 52.3% | ArrayMathMatrix |
| String to Integer (atoi) | Medium | 20.6% | 52.3% | String |
| Rectangle Area | Medium | 49.0% | 52.3% | MathGeometry |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 52.3% | StringTreeDepth-First Search+3 |
| Remove Stones to Minimize the Total | Medium | 65.5% | 52.3% | ArrayGreedyHeap (Priority Queue) |
| Asteroid Collision | Medium | 47.2% | 52.3% | ArrayStackSimulation |
| Jump Game | Medium | 40.5% | 52.3% | ArrayDynamic ProgrammingGreedy |
| Valid Anagram | Easy | 67.8% | 52.3% | Hash TableStringSorting |
| Product of Array Except Self | Medium | 68.6% | 52.3% | ArrayPrefix Sum |
| Power of Two | Easy | 49.9% | 52.3% | MathBit ManipulationRecursion |
| Copy List with Random Pointer | Medium | 62.4% | 52.3% | Hash TableLinked List |
| Break a Palindrome | Medium | 51.6% | 52.3% | StringGreedy |
| String Compression | Medium | 59.6% | 52.3% | Two PointersString |
| Subarray Sum Equals K | Medium | 46.8% | 52.3% | ArrayHash TablePrefix Sum |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 52.3% | ArrayGreedySorting+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 45.8% | ArrayHash TableUnion-Find |
| Min Stack | Medium | 57.7% | 45.8% | StackDesign |
| Palindrome Linked List | Easy | 57.5% | 45.8% | Linked ListTwo PointersStack+1 |
| Generate Parentheses | Medium | 78.3% | 45.8% | StringDynamic ProgrammingBacktracking |
| Climbing Stairs | Easy | 53.9% | 45.8% | MathDynamic ProgrammingMemoization |
| Reverse Linked List II | Medium | 51.0% | 45.8% | Linked List |
| Maximal Square | Medium | 50.0% | 45.8% | ArrayDynamic ProgrammingMatrix |
| Find Median from Data Stream | Hard | 54.2% | 45.8% | Two PointersDesignSorting+2 |
| Counting Bits | Easy | 80.4% | 45.8% | Dynamic ProgrammingBit Manipulation |
| Set Matrix Zeroes | Medium | 62.5% | 45.8% | ArrayHash TableMatrix |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 45.8% | ArrayHash TableSliding Window |
| Remove Duplicates from Sorted List | Easy | 56.3% | 45.8% | Linked List |
| Course Schedule II | Medium | 55.0% | 45.8% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Path Sum | Medium | 67.8% | 45.8% | ArrayDynamic ProgrammingMatrix |
| Course Schedule | Medium | 50.8% | 45.8% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Spiral Matrix | Medium | 56.2% | 45.8% | ArrayMatrixSimulation |
| Count the Number of Good Subsequences | Medium | 48.3% | 45.8% | Hash TableMathString+2 |
| Linked List Cycle | Easy | 53.9% | 45.8% | Hash TableLinked ListTwo Pointers |
| Find Peak Element | Medium | 46.8% | 45.8% | ArrayBinary Search |
| First Unique Character in a String | Easy | 65.1% | 45.8% | Hash TableStringQueue+1 |
| Sort Colors | Medium | 69.2% | 45.8% | ArrayTwo PointersSorting |
| Rotting Oranges | Medium | 58.2% | 45.8% | ArrayBreadth-First SearchMatrix |
| Find the Celebrity | Medium | 48.9% | 45.8% | Two PointersGraph TheoryInteractive |
| Longest Increasing Subsequence | Medium | 59.1% | 45.8% | ArrayBinary SearchDynamic Programming |
| 3Sum | Medium | 38.6% | 45.8% | ArrayTwo PointersSorting |
| Network Delay Time | Medium | 59.8% | 36.9% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Koko Eating Bananas | Medium | 49.7% | 36.9% | ArrayBinary Search |
| Count Primes | Medium | 35.8% | 36.9% | ArrayMathEnumeration+1 |
| Design Circular Queue | Medium | 54.0% | 36.9% | ArrayLinked ListDesign+1 |
| Binary Subarrays With Sum | Medium | 68.3% | 36.9% | ArrayHash TableSliding Window+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 36.9% | ArrayDivide and ConquerSorting+2 |
| H-Index | Medium | 41.2% | 36.9% | ArraySortingCounting Sort |
| Sliding Puzzle | Hard | 74.2% | 36.9% | ArrayDynamic ProgrammingBacktracking+3 |
| Delete Duplicate Folders in System | Hard | 77.7% | 36.9% | ArrayHash TableString+4 |
| Number of 1 Bits | Easy | 76.4% | 36.9% | Divide and ConquerBit Manipulation |
| Linked List Random Node | Medium | 64.7% | 36.9% | Linked ListMathReservoir Sampling+1 |
| Minimum Size Subarray Sum | Medium | 51.1% | 36.9% | ArrayBinary SearchSliding Window+1 |
| Minimum Knight Moves | Medium | 41.8% | 36.9% | Breadth-First Search |
| The Maze | Medium | 60.3% | 36.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Integer to English Words | Hard | 34.8% | 36.9% | MathStringRecursion |
| All Possible Full Binary Trees | Medium | 82.7% | 36.9% | Dynamic ProgrammingTreeRecursion+2 |
| Task Scheduler | Medium | 62.7% | 36.9% | ArrayHash TableGreedy+3 |
| Largest Number | Medium | 42.6% | 36.9% | ArrayStringGreedy+1 |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 36.9% | Linked ListTwo Pointers |
| Clone Graph | Medium | 64.7% | 36.9% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Sqrt(x) | Easy | 41.4% | 36.9% | MathBinary Search |
| Daily Temperatures | Medium | 68.4% | 36.9% | ArrayStackMonotonic Stack |
| Middle of the Linked List | Easy | 81.6% | 36.9% | Linked ListTwo Pointers |
| Merge Two Sorted Lists | Easy | 68.0% | 36.9% | Linked ListRecursion |
| Merge In Between Linked Lists | Medium | 82.9% | 36.9% | Linked List |
| Maximum Product of Three Numbers | Easy | 45.7% | 36.9% | ArrayMathSorting |
| Number of Lines To Write String | Easy | 72.1% | 36.9% | ArrayString |
| Next Greater Element II | Medium | 67.9% | 36.9% | ArrayStackMonotonic Stack |
| Pow(x, n) | Medium | 38.3% | 36.9% | MathRecursion |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 36.9% | ArrayQueueSliding Window+3 |
| Number of Ways to Split Array | Medium | 55.9% | 36.9% | ArrayPrefix Sum |
| Reverse String | Easy | 80.6% | 36.9% | Two PointersString |
| Longest Common Prefix | Easy | 47.1% | 36.9% | ArrayStringTrie |
| Max Points on a Line | Hard | 30.3% | 36.9% | ArrayHash TableMath+1 |
| Unique Paths | Medium | 66.6% | 36.9% | MathDynamic ProgrammingCombinatorics |
| Simplify Path | Medium | 50.0% | 36.9% | StringStack |
| Word Pattern | Easy | 43.8% | 36.9% | Hash TableString |
| The Skyline Problem | Hard | 45.0% | 36.9% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Find K Closest Elements | Medium | 49.4% | 36.9% | ArrayTwo PointersBinary Search+3 |
| Third Maximum Number | Easy | 38.9% | 36.9% | ArraySorting |
| Decode String | Medium | 62.3% | 36.9% | StringStackRecursion |
| Median of Two Sorted Arrays | Hard | 46.0% | 36.9% | ArrayBinary SearchDivide and Conquer |
| Shuffle an Array | Medium | 59.6% | 36.9% | ArrayMathDesign+1 |
| Longest Palindromic Substring | Medium | 37.4% | 36.9% | Two PointersStringDynamic Programming |
| Diameter of Binary Tree | Easy | 65.1% | 36.9% | TreeDepth-First SearchBinary Tree |
| Compare Version Numbers | Medium | 46.1% | 36.9% | Two PointersString |
| Maximum Product Subarray | Medium | 36.0% | 36.9% | ArrayDynamic Programming |
| Number of Visible People in a Queue | Hard | 72.4% | 36.9% | ArrayStackMonotonic Stack |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 36.9% | Hash TableTreeDepth-First Search+2 |
| Add Two Numbers II | Medium | 62.4% | 36.9% | Linked ListMathStack |
| Contains Duplicate | Easy | 64.1% | 36.9% | ArrayHash TableSorting |
| Design Memory Allocator | Medium | 49.7% | 36.9% | ArrayHash TableDesign+1 |
| Fizz Buzz Multithreaded | Medium | 74.6% | 36.9% | Concurrency |
| Longest Cycle in a Graph | Hard | 50.5% | 36.9% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Previous Permutation With One Swap | Medium | 49.3% | 36.9% | ArrayGreedy |