| Longest Subarray of 1's After Deleting One Element | Medium | 71.0% | 100.0% | ArrayDynamic ProgrammingSliding Window |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Summary Ranges | Easy | 53.9% | 87.5% | Array |
| String Compression | Medium | 59.5% | 87.5% | Two PointersString |
| Find K Closest Elements | Medium | 49.4% | 87.5% | ArrayTwo PointersBinary Search+3 |
| Maximize Distance to Closest Person | Medium | 49.6% | 87.5% | Array |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Merge Intervals | Medium | 51.1% | 75.0% | ArraySorting |
| Valid Palindrome | Easy | 52.8% | 75.0% | Two PointersString |
| One Edit Distance | Medium | 34.5% | 75.0% | |
| Number of Islands | Medium | 63.8% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Isomorphic Strings | Easy | 48.0% | 75.0% | Hash TableString |
| Move Zeroes | Easy | 63.5% | 75.0% | ArrayTwo Pointers |
| Line Reflection | Medium | 36.3% | 75.0% | |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 75.0% | ArrayHash TableMath+2 |
| Find All Anagrams in a String | Medium | 53.3% | 75.0% | Hash TableStringSliding Window |
| Subarray Sum Equals K | Medium | 46.8% | 75.0% | ArrayHash TablePrefix Sum |
| Permutation in String | Medium | 48.4% | 75.0% | Hash TableTwo PointersString+1 |
| Valid Palindrome II | Easy | 44.0% | 75.0% | Two PointersStringGreedy |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 75.0% | ArrayHash TableBit Manipulation |
| Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 64.9% | 75.0% | Array |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| Container With Most Water | Medium | 59.5% | 62.5% | ArrayTwo PointersGreedy |
| Valid Parentheses | Easy | 43.7% | 62.5% | StringStack |
| Merge Two Sorted Lists | Easy | 67.9% | 62.5% | Linked ListRecursion |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Merge Sorted Array | Easy | 54.4% | 62.5% | ArrayTwo PointersSorting |
| Min Stack | Medium | 57.7% | 62.5% | StackDesign |
| Interval List Intersections | Medium | 72.9% | 62.5% | ArrayTwo PointersSweep Line |
| Design an ATM Machine | Medium | 44.5% | 62.5% | ArrayGreedyDesign |
| Is Subsequence | Easy | 48.8% | 62.5% | Two PointersStringDynamic Programming |
| Squares of a Sorted Array | Easy | 73.6% | 62.5% | ArrayTwo PointersSorting |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Median of Two Sorted Arrays | Hard | 45.9% | 50.0% | ArrayBinary SearchDivide and Conquer |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Merge k Sorted Lists | Hard | 58.8% | 50.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Minimum Window Substring | Hard | 46.9% | 50.0% | Hash TableStringSliding Window |
| Symmetric Tree | Easy | 60.7% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 50.0% | ArrayDynamic Programming |
| Max Consecutive Ones III | Medium | 67.3% | 50.0% | ArrayBinary SearchSliding Window+1 |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Binary Tree Right Side View | Medium | 69.5% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 50.0% | TreeDepth-First SearchBinary Tree |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Perfect Squares | Medium | 56.3% | 50.0% | MathDynamic ProgrammingBreadth-First Search |
| Reconstruct Itinerary | Hard | 44.3% | 50.0% | ArrayStringDepth-First Search+4 |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 50.0% | |
| Design Hit Counter | Medium | 69.6% | 50.0% | |
| Find Duplicate Subtrees | Medium | 60.6% | 50.0% | Hash TableTreeDepth-First Search+1 |
| Monotonic Array | Easy | 62.2% | 50.0% | Array |
| Number of Recent Calls | Easy | 78.1% | 50.0% | DesignQueueData Stream |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Count Substrings Without Repeating Character | Medium | 76.1% | 50.0% | |
| Reverse Integer | Medium | 31.5% | 37.5% | Math |
| Remove Element | Easy | 61.3% | 37.5% | ArrayTwo Pointers |
| Validate Binary Search Tree | Medium | 35.3% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 37.5% | TreeBreadth-First SearchBinary Tree |
| Balanced Binary Tree | Easy | 57.8% | 37.5% | TreeDepth-First SearchBinary Tree |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 37.5% | ArrayBinary Search |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 37.5% | ArrayTwo PointersBinary Search |
| Reverse Linked List | Easy | 80.2% | 37.5% | Linked ListRecursion |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.0% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Valid Anagram | Easy | 67.8% | 37.5% | Hash TableStringSorting |
| Longest Increasing Subsequence | Medium | 59.0% | 37.5% | ArrayBinary SearchDynamic Programming |
| Intersection of Two Arrays | Easy | 77.5% | 37.5% | ArrayHash TableTwo Pointers+2 |
| Intersection of Two Arrays II | Easy | 59.7% | 37.5% | ArrayHash TableTwo Pointers+2 |
| First Unique Character in a String | Easy | 65.0% | 37.5% | Hash TableStringQueue+1 |
| Longest Repeating Character Replacement | Medium | 59.0% | 37.5% | Hash TableStringSliding Window |
| Max Consecutive Ones | Easy | 64.6% | 37.5% | Array |
| Continuous Subarray Sum | Medium | 31.2% | 37.5% | ArrayHash TableMath+1 |
| Destination City | Easy | 79.5% | 37.5% | ArrayHash TableString |
| Can Place Flowers | Easy | 29.0% | 37.5% | ArrayGreedy |
| Debounce | Medium | 91.8% | 37.5% | |
| Jewels and Stones | Easy | 89.5% | 37.5% | Hash TableString |
| Product of Two Run-Length Encoded Arrays | Medium | 59.6% | 37.5% | |
| Longest Continuous Increasing Subsequence | Easy | 51.8% | 37.5% | Array |
| Range Sum of BST | Easy | 87.6% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 37.5% | Hash TableStringBacktracking |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 37.5% | ArrayTwo Pointers |
| 4Sum | Medium | 40.0% | 37.5% | ArrayTwo PointersSorting |
| Coin Change | Medium | 47.9% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Implement Queue using Stacks | Easy | 69.3% | 37.5% | StackDesignQueue |
| Remove Nth Node From End of List | Medium | 51.0% | 37.5% | Linked ListTwo Pointers |
| Daily Temperatures | Medium | 68.3% | 37.5% | ArrayStackMonotonic Stack |
| Find Median from Data Stream | Hard | 54.2% | 37.5% | Two PointersDesignSorting+2 |
| Add Strings | Easy | 52.1% | 37.5% | MathStringSimulation |
| Maximum Subarray | Medium | 53.0% | 37.5% | ArrayDivide and ConquerDynamic Programming |
| Matrix Diagonal Sum | Easy | 84.1% | 37.5% | ArrayMatrix |
| Allow One Function Call | Easy | 86.7% | 37.5% | |
| Path Crossing | Easy | 62.6% | 37.5% | Hash TableString |
| Function Composition | Easy | 86.9% | 37.5% | |
| Minimum Size Subarray Sum | Medium | 51.0% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Single Number | Easy | 77.3% | 25.0% | ArrayBit Manipulation |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 25.0% | ArrayMathStack |
| Majority Element | Easy | 66.1% | 25.0% | ArrayHash TableDivide and Conquer+2 |
| Contains Duplicate III | Hard | 24.4% | 25.0% | ArraySliding WindowSorting+2 |
| Palindrome Linked List | Easy | 57.4% | 25.0% | Linked ListTwo PointersStack+1 |
| Top K Frequent Elements | Medium | 65.8% | 25.0% | ArrayHash TableDivide and Conquer+5 |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 25.0% | Hash TableStringDivide and Conquer+1 |
| Max Consecutive Ones II | Medium | 51.9% | 25.0% | |
| Partition Labels | Medium | 81.8% | 25.0% | Hash TableTwo PointersString+1 |
| Max Number of K-Sum Pairs | Medium | 56.9% | 25.0% | ArrayHash TableTwo Pointers+1 |
| Text Justification | Hard | 50.4% | 25.0% | ArrayStringSimulation |
| Maximum Sum of Almost Unique Subarray | Medium | 40.7% | 25.0% | ArrayHash TableSliding Window |
| Roman to Integer | Easy | 66.2% | 25.0% | Hash TableMathString |
| Merge Two 2D Arrays by Summing Values | Easy | 81.8% | 25.0% | ArrayHash TableTwo Pointers |
| Implement Rand10() Using Rand7() | Medium | 46.2% | 25.0% | MathRejection SamplingRandomized+1 |
| Design an Ordered Stream | Easy | 82.6% | 25.0% | ArrayHash TableDesign+1 |
| Boats to Save People | Medium | 61.4% | 25.0% | ArrayTwo PointersGreedy+1 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 25.0% | TreeBreadth-First SearchBinary Tree |
| Swap Nodes in Pairs | Medium | 68.9% | 25.0% | Linked ListRecursion |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 25.0% | |
| Linked List Cycle | Easy | 53.9% | 25.0% | Hash TableLinked ListTwo Pointers |
| Create Hello World Function | Easy | 82.0% | 25.0% | |
| Cinema Seat Allocation | Medium | 43.6% | 25.0% | ArrayHash TableGreedy+1 |
| Sliding Window Maximum | Hard | 48.4% | 25.0% | ArrayQueueSliding Window+2 |
| Counter II | Easy | 81.2% | 25.0% | |
| Search Insert Position | Easy | 50.7% | 25.0% | ArrayBinary Search |
| Rotting Oranges | Medium | 58.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Employees Earning More Than Their Managers | Easy | 72.8% | 25.0% | Database |
| Maximum Average Subarray I | Easy | 47.0% | 25.0% | ArraySliding Window |
| Find the Difference of Two Arrays | Easy | 81.3% | 25.0% | ArrayHash Table |
| Simple Bank System | Medium | 69.8% | 25.0% | ArrayHash TableDesign+1 |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 25.0% | ArrayHash Table |
| Flatten Nested List Iterator | Medium | 65.6% | 25.0% | StackTreeDepth-First Search+3 |
| Subarray Sums Divisible by K | Medium | 56.0% | 25.0% | ArrayHash TablePrefix Sum |
| Palindrome Number | Easy | 60.2% | 25.0% | Math |
| Search a 2D Matrix | Medium | 53.5% | 25.0% | ArrayBinary SearchMatrix |
| Count Number of Pairs With Absolute Difference K | Easy | 85.3% | 25.0% | ArrayHash TableCounting |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 25.0% | ArrayQueueSliding Window+3 |