| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Group Anagrams | Medium | 72.2% | 92.4% | ArrayHash TableString+1 |
| Special Binary String | Hard | 79.3% | 92.4% | StringDivide and ConquerSorting |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 92.4% | Hash TableStringSliding Window |
| Majority Element | Easy | 66.1% | 92.4% | ArrayHash TableDivide and Conquer+2 |
| Add Two Numbers | Medium | 48.0% | 90.6% | Linked ListMathRecursion |
| Median of Two Sorted Arrays | Hard | 46.0% | 90.6% | ArrayBinary SearchDivide and Conquer |
| 3Sum | Medium | 38.6% | 86.5% | ArrayTwo PointersSorting |
| Reverse Linked List | Easy | 80.3% | 86.5% | Linked ListRecursion |
| Smallest Range II | Medium | 37.7% | 86.5% | ArrayMathGreedy+1 |
| Climbing Stairs | Easy | 53.9% | 86.5% | MathDynamic ProgrammingMemoization |
| Merge Intervals | Medium | 51.2% | 84.3% | ArraySorting |
| Nim Game | Easy | 59.3% | 84.3% | MathBrainteaserGame Theory |
| Number of Increasing Paths in a Grid | Hard | 57.4% | 84.3% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 84.3% | ArrayTwo PointersGreedy+3 |
| LRU Cache | Medium | 46.8% | 81.7% | Hash TableLinked ListDesign+1 |
| Tenth Line | Easy | 36.2% | 81.7% | Shell |
| Delete Node in a Linked List | Medium | 83.6% | 81.7% | Linked List |
| Kth Largest Element in a Stream | Easy | 60.7% | 81.7% | TreeDesignBinary Search Tree+3 |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 81.7% | StringStack |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% | 81.7% | ArraySliding Window |
| Add Digits | Easy | 68.6% | 81.7% | MathSimulationNumber Theory |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.1% | 81.7% | ArrayMathDynamic Programming+5 |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 81.7% | ArrayTwo PointersGreedy |
| Preimage Size of Factorial Zeroes Function | Hard | 46.7% | 81.7% | MathBinary Search |
| Choose Numbers From Two Arrays in Range | Hard | 52.9% | 81.7% | ArrayDynamic Programming |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% | 81.7% | ArrayTwo Pointers |
| Minimizing Array After Replacing Pairs With Their Product | Medium | 40.7% | 81.7% | ArrayDynamic ProgrammingGreedy |
| Minimize XOR | Medium | 62.4% | 81.7% | GreedyBit Manipulation |
| Smallest Range I | Easy | 73.3% | 81.7% | ArrayMath |
| Bitwise OR of Adjacent Elements | Easy | 94.7% | 81.7% | ArrayBit Manipulation |
| Plates Between Candles | Medium | 47.3% | 81.7% | ArrayStringBinary Search+1 |
| Number of Islands | Medium | 63.8% | 79.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Window Substring | Hard | 47.0% | 75.9% | Hash TableStringSliding Window |
| Threshold Majority Queries | Hard | 21.7% | 75.9% | ArrayHash TableBinary Search+3 |
| Minimum Moves to Equal Array Elements III | Easy | 81.3% | 75.9% | ArrayMath |
| Integer to Roman | Medium | 70.5% | 72.4% | Hash TableMathString |
| Next Permutation | Medium | 44.8% | 72.4% | ArrayTwo Pointers |
| Jump Game | Medium | 40.5% | 72.4% | ArrayDynamic ProgrammingGreedy |
| Trapping Rain Water | Hard | 66.8% | 72.4% | ArrayTwo PointersDynamic Programming+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 72.4% | ArrayDynamic Programming |
| Validate IP Address | Medium | 28.2% | 72.4% | String |
| Longest Common Prefix | Easy | 47.1% | 68.3% | ArrayStringTrie |
| Maximum Product Subarray | Medium | 36.0% | 68.3% | ArrayDynamic Programming |
| Sort Array by Increasing Frequency | Easy | 80.7% | 68.3% | ArrayHash TableSorting |
| Longest Palindromic Substring | Medium | 37.4% | 68.3% | Two PointersStringDynamic Programming |
| Valid Parentheses | Easy | 43.7% | 68.3% | StringStack |
| Gas Station | Medium | 47.5% | 63.6% | ArrayGreedy |
| Largest Number | Medium | 42.6% | 63.6% | ArrayStringGreedy+1 |
| Spiral Matrix | Medium | 56.2% | 63.6% | ArrayMatrixSimulation |
| Top K Frequent Elements | Medium | 65.9% | 63.6% | ArrayHash TableDivide and Conquer+5 |
| Minimum Processing Time | Medium | 70.2% | 63.6% | ArrayGreedySorting |
| Top K Frequent Words | Medium | 60.0% | 63.6% | ArrayHash TableString+5 |
| Restore IP Addresses | Medium | 55.3% | 63.6% | StringBacktracking |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 63.6% | TreeDepth-First SearchBinary Tree |
| Coin Change | Medium | 48.0% | 63.6% | ArrayDynamic ProgrammingBreadth-First Search |
| Koko Eating Bananas | Medium | 49.7% | 63.6% | ArrayBinary Search |
| Fruit Into Baskets | Medium | 50.5% | 63.6% | ArrayHash TableSliding Window |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 57.7% | Dynamic ProgrammingTreeDepth-First Search+1 |
| String to Integer (atoi) | Medium | 20.6% | 57.7% | String |
| Roman to Integer | Easy | 66.3% | 57.7% | Hash TableMathString |
| Rotting Oranges | Medium | 58.2% | 57.7% | ArrayBreadth-First SearchMatrix |
| Count Pairs Of Similar Strings | Easy | 73.6% | 57.7% | ArrayHash TableString+2 |
| Search a 2D Matrix | Medium | 53.6% | 57.7% | ArrayBinary SearchMatrix |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 57.7% | TreeBreadth-First SearchBinary Tree |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 57.7% | ArrayBreadth-First SearchMatrix |
| Search in Rotated Sorted Array | Medium | 44.1% | 57.7% | ArrayBinary Search |
| Remove K Digits | Medium | 36.4% | 57.7% | StringStackGreedy+1 |
| Game of Life | Medium | 72.4% | 50.3% | ArrayMatrixSimulation |
| Flatten Nested List Iterator | Medium | 65.6% | 50.3% | StackTreeDepth-First Search+3 |
| Minimum Cost For Tickets | Medium | 67.4% | 50.3% | ArrayDynamic Programming |
| Is Subsequence | Easy | 48.9% | 50.3% | Two PointersStringDynamic Programming |
| Heaters | Medium | 41.4% | 50.3% | ArrayTwo PointersBinary Search+1 |
| Basic Calculator II | Medium | 46.7% | 50.3% | MathStringStack |
| Reverse Integer | Medium | 31.5% | 50.3% | Math |
| Jump Game II | Medium | 42.5% | 50.3% | ArrayDynamic ProgrammingGreedy |
| Rotate Image | Medium | 79.4% | 50.3% | ArrayMathMatrix |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 50.3% | ArrayHash TableDivide and Conquer+2 |
| House Robber | Medium | 52.9% | 50.3% | ArrayDynamic Programming |
| Product of Array Except Self | Medium | 68.6% | 50.3% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.5% | 50.3% | ArrayQueueSliding Window+2 |
| Number of Provinces | Medium | 70.0% | 50.3% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.3% | TreeBreadth-First SearchBinary Tree |
| Meeting Rooms II | Medium | 52.6% | 50.3% | ArrayTwo PointersGreedy+3 |
| Shopping Offers | Medium | 52.3% | 50.3% | ArrayDynamic ProgrammingBacktracking+3 |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 50.3% | ArrayDynamic ProgrammingDepth-First Search+5 |
| N-Queens | Hard | 75.0% | 50.3% | ArrayBacktracking |
| Sum of All Subset XOR Totals | Easy | 90.1% | 50.3% | ArrayMathBacktracking+3 |
| Unit Conversion I | Medium | 54.3% | 50.3% | Depth-First SearchBreadth-First SearchGraph Theory |
| Nested List Weight Sum | Medium | 85.9% | 50.3% | Depth-First SearchBreadth-First Search |
| Generate Parentheses | Medium | 78.3% | 50.3% | StringDynamic ProgrammingBacktracking |
| Remove Element | Easy | 61.4% | 50.3% | ArrayTwo Pointers |
| Longest Consecutive Sequence | Medium | 47.0% | 50.3% | ArrayHash TableUnion-Find |
| Single Number | Easy | 77.4% | 50.3% | ArrayBit Manipulation |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 50.3% | Hash TableTreeDepth-First Search+2 |
| Contains Duplicate II | Easy | 50.8% | 50.3% | ArrayHash TableSliding Window |
| Container With Most Water | Medium | 59.6% | 39.9% | ArrayTwo PointersGreedy |
| Reverse Nodes in k-Group | Hard | 65.4% | 39.9% | Linked ListRecursion |
| Combination Sum II | Medium | 59.0% | 39.9% | ArrayBacktracking |
| Valid Palindrome | Easy | 52.8% | 39.9% | Two PointersString |
| Word Ladder | Hard | 44.9% | 39.9% | Hash TableStringBreadth-First Search |
| Surrounded Regions | Medium | 44.8% | 39.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Min Stack | Medium | 57.7% | 39.9% | StackDesign |
| Binary Search Tree Iterator | Medium | 76.2% | 39.9% | StackTreeDesign+3 |
| Course Schedule | Medium | 50.8% | 39.9% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Missing Number | Easy | 71.7% | 39.9% | ArrayHash TableMath+3 |
| Move Zeroes | Easy | 63.6% | 39.9% | ArrayTwo Pointers |
| Longest Repeating Character Replacement | Medium | 59.1% | 39.9% | Hash TableStringSliding Window |
| Single Element in a Sorted Array | Medium | 59.2% | 39.9% | ArrayBinary Search |
| 01 Matrix | Medium | 53.4% | 39.9% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Next Greater Element III | Medium | 35.2% | 39.9% | MathTwo PointersString |
| Permutation in String | Medium | 48.5% | 39.9% | Hash TableTwo PointersString+1 |
| Search Suggestions System | Medium | 65.1% | 39.9% | ArrayStringBinary Search+3 |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 39.9% | Database |
| To Be Or Not To Be | Easy | 63.3% | 39.9% | |
| Random Pick with Weight | Medium | 48.9% | 39.9% | ArrayMathBinary Search+2 |
| Decode Ways | Medium | 37.6% | 39.9% | StringDynamic Programming |
| Contiguous Array | Medium | 50.8% | 39.9% | ArrayHash TablePrefix Sum |
| Split the Array | Easy | 60.9% | 39.9% | ArrayHash TableCounting |
| Cousins in Binary Tree | Easy | 59.1% | 39.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Design Twitter | Medium | 44.2% | 39.9% | Hash TableLinked ListDesign+1 |
| Increment Submatrices by One | Medium | 73.8% | 39.9% | ArrayMatrixPrefix Sum |
| Shortest Path to Get All Keys | Hard | 54.3% | 39.9% | ArrayBit ManipulationBreadth-First Search+1 |
| Range Sum Query - Mutable | Medium | 42.6% | 39.9% | ArrayDivide and ConquerDesign+2 |
| Pacific Atlantic Water Flow | Medium | 60.6% | 39.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Max Consecutive Ones III | Medium | 67.3% | 39.9% | ArrayBinary SearchSliding Window+1 |
| Count Complete Tree Nodes | Easy | 72.1% | 39.9% | Binary SearchBit ManipulationTree+1 |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 39.9% | ArrayTwo PointersBinary Search |
| Trim a Binary Search Tree | Medium | 66.6% | 39.9% | TreeDepth-First SearchBinary Search Tree+1 |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% | 39.9% | ArrayHash TableBit Manipulation+1 |
| Boundary of Binary Tree | Medium | 47.9% | 39.9% | TreeDepth-First SearchBinary Tree |
| Add Binary | Easy | 57.7% | 39.9% | MathStringBit Manipulation+1 |
| Pow(x, n) | Medium | 38.3% | 39.9% | MathRecursion |
| Reformat Date | Easy | 68.3% | 39.9% | String |
| Squares of a Sorted Array | Easy | 73.6% | 39.9% | ArrayTwo PointersSorting |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 39.9% | Two PointersStringStack+1 |
| Largest Rectangle in Histogram | Hard | 49.4% | 39.9% | ArrayStackMonotonic Stack |
| Subarray Sum Equals K | Medium | 46.8% | 39.9% | ArrayHash TablePrefix Sum |
| Maximum Profit From Trading Stocks | Medium | 48.0% | 39.9% | ArrayDynamic Programming |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 39.9% | ArraySliding Window |
| Kth Largest Element in an Array | Medium | 68.8% | 39.9% | ArrayDivide and ConquerSorting+2 |
| Basic Calculator | Hard | 46.6% | 39.9% | MathStringStack+1 |
| Reconstruct Itinerary | Hard | 44.3% | 39.9% | ArrayStringDepth-First Search+4 |
| Find the Difference of Two Arrays | Easy | 81.3% | 39.9% | ArrayHash Table |
| Minimum Number of Days to Make m Bouquets | Medium | 56.3% | 39.9% | ArrayBinary Search |
| Spiral Matrix II | Medium | 74.7% | 39.9% | ArrayMatrixSimulation |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 39.9% | ArrayDynamic ProgrammingGreedy |
| Max Area of Island | Medium | 73.8% | 39.9% | ArrayDepth-First SearchBreadth-First Search+2 |