| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Median of Two Sorted Arrays | Hard | 45.9% | 87.5% | ArrayBinary SearchDivide and Conquer |
| Add Two Numbers | Medium | 47.9% | 75.0% | Linked ListMathRecursion |
| Integer to Roman | Medium | 70.4% | 75.0% | Hash TableMathString |
| Longest Common Prefix | Easy | 47.1% | 75.0% | ArrayStringTrie |
| 3Sum | Medium | 38.6% | 75.0% | ArrayTwo PointersSorting |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Trapping Rain Water | Hard | 66.8% | 75.0% | ArrayTwo PointersDynamic Programming+2 |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Merge Intervals | Medium | 51.1% | 75.0% | ArraySorting |
| Climbing Stairs | Easy | 53.9% | 75.0% | MathDynamic ProgrammingMemoization |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| Majority Element | Easy | 66.1% | 75.0% | ArrayHash TableDivide and Conquer+2 |
| Tenth Line | Easy | 36.1% | 75.0% | Shell |
| Reverse Linked List | Easy | 80.2% | 75.0% | Linked ListRecursion |
| Delete Node in a Linked List | Medium | 83.6% | 75.0% | Linked List |
| Add Digits | Easy | 68.6% | 75.0% | MathSimulationNumber Theory |
| Nim Game | Easy | 59.2% | 75.0% | MathBrainteaserGame Theory |
| Kth Largest Element in a Stream | Easy | 60.7% | 75.0% | TreeDesignBinary Search Tree+3 |
| Preimage Size of Factorial Zeroes Function | Hard | 46.6% | 75.0% | MathBinary Search |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% | 75.0% | ArrayTwo Pointers |
| Smallest Range I | Easy | 73.3% | 75.0% | ArrayMath |
| Smallest Range II | Medium | 37.7% | 75.0% | ArrayMathGreedy+1 |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 75.0% | StringStack |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.0% | 75.0% | ArrayMathDynamic Programming+5 |
| Plates Between Candles | Medium | 47.3% | 75.0% | ArrayStringBinary Search+1 |
| Choose Numbers From Two Arrays in Range | Hard | 52.9% | 75.0% | |
| Number of Increasing Paths in a Grid | Hard | 57.4% | 75.0% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 75.0% | ArrayTwo PointersGreedy+3 |
| Minimize XOR | Medium | 62.4% | 75.0% | GreedyBit Manipulation |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 75.0% | |
| Minimizing Array After Replacing Pairs With Their Product | Medium | 40.7% | 75.0% | |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% | 75.0% | ArraySliding Window |
| Bitwise OR of Adjacent Elements | Easy | 94.7% | 75.0% | |
| Special Binary String | Hard | 75.9% | 75.0% | StringDivide and ConquerSorting |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| Reverse Integer | Medium | 31.5% | 62.5% | Math |
| Roman to Integer | Easy | 66.2% | 62.5% | Hash TableMathString |
| Next Permutation | Medium | 44.7% | 62.5% | ArrayTwo Pointers |
| First Missing Positive | Hard | 42.4% | 62.5% | ArrayHash Table |
| Spiral Matrix | Medium | 56.1% | 62.5% | ArrayMatrixSimulation |
| Jump Game | Medium | 40.5% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Minimum Window Substring | Hard | 46.9% | 62.5% | Hash TableStringSliding Window |
| Longest Consecutive Sequence | Medium | 47.0% | 62.5% | ArrayHash TableUnion-Find |
| LRU Cache | Medium | 46.8% | 62.5% | Hash TableLinked ListDesign+1 |
| Maximum Product Subarray | Medium | 36.0% | 62.5% | ArrayDynamic Programming |
| House Robber | Medium | 52.9% | 62.5% | ArrayDynamic Programming |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 62.5% | TreeDepth-First SearchBinary Tree |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Fruit Into Baskets | Medium | 50.5% | 62.5% | ArrayHash TableSliding Window |
| Threshold Majority Queries | Hard | 21.7% | 62.5% | ArrayHash TableBinary Search+3 |
| Validate IP Address | Medium | 28.2% | 62.5% | String |
| Sort Array by Increasing Frequency | Easy | 80.7% | 62.5% | ArrayHash TableSorting |
| Minimum Moves to Equal Array Elements III | Easy | 81.2% | 62.5% | ArrayMath |
| String to Integer (atoi) | Medium | 20.6% | 50.0% | String |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| Letter Combinations of a Phone Number | Medium | 65.5% | 50.0% | Hash TableStringBacktracking |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 50.0% | ArrayTwo Pointers |
| Remove Element | Easy | 61.3% | 50.0% | ArrayTwo Pointers |
| Jump Game II | Medium | 42.4% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Sqrt(x) | Easy | 41.4% | 50.0% | MathBinary Search |
| Search a 2D Matrix | Medium | 53.5% | 50.0% | ArrayBinary SearchMatrix |
| Merge Sorted Array | Easy | 54.4% | 50.0% | ArrayTwo PointersSorting |
| Restore IP Addresses | Medium | 55.3% | 50.0% | StringBacktracking |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 50.0% | ArrayHash TableDivide and Conquer+2 |
| Pascal's Triangle | Easy | 78.7% | 50.0% | ArrayDynamic Programming |
| Largest Number | Medium | 42.6% | 50.0% | ArrayStringGreedy+1 |
| Course Schedule | Medium | 50.8% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Intersection of Two Arrays | Easy | 77.5% | 50.0% | ArrayHash TableTwo Pointers+2 |
| Single Element in a Sorted Array | Medium | 59.2% | 50.0% | ArrayBinary Search |
| Number of Provinces | Medium | 70.0% | 50.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Subarray Product Less Than K | Medium | 53.9% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Random Pick with Weight | Medium | 48.9% | 50.0% | ArrayMathBinary Search+2 |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Merge Strings Alternately | Easy | 82.1% | 50.0% | Two PointersString |
| Create Hello World Function | Easy | 82.0% | 50.0% | |
| Minimum Processing Time | Medium | 70.2% | 50.0% | ArrayGreedySorting |
| Count Pairs Of Similar Strings | Easy | 73.5% | 50.0% | ArrayHash TableString+2 |
| Top K Frequent Words | Medium | 60.0% | 50.0% | ArrayHash TableString+5 |
| Palindrome Number | Easy | 60.2% | 37.5% | Math |
| Merge Two Sorted Lists | Easy | 67.9% | 37.5% | Linked ListRecursion |
| Merge k Sorted Lists | Hard | 58.8% | 37.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Reverse Nodes in k-Group | Hard | 65.3% | 37.5% | Linked ListRecursion |
| Find the Index of the First Occurrence in a String | Easy | 46.2% | 37.5% | Two PointersStringString Matching |
| Longest Valid Parentheses | Hard | 38.0% | 37.5% | StringDynamic ProgrammingStack |
| Search in Rotated Sorted Array | Medium | 44.1% | 37.5% | ArrayBinary Search |
| Search Insert Position | Easy | 50.7% | 37.5% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.1% | 37.5% | ArrayHash TableMatrix |
| Sudoku Solver | Hard | 65.4% | 37.5% | ArrayHash TableBacktracking+1 |
| Combination Sum II | Medium | 59.0% | 37.5% | ArrayBacktracking |
| Permutations | Medium | 81.6% | 37.5% | ArrayBacktracking |
| Rotate Image | Medium | 79.3% | 37.5% | ArrayMathMatrix |
| Pow(x, n) | Medium | 38.2% | 37.5% | MathRecursion |
| N-Queens | Hard | 74.9% | 37.5% | ArrayBacktracking |
| Unique Paths | Medium | 66.5% | 37.5% | MathDynamic ProgrammingCombinatorics |
| Plus One | Easy | 49.5% | 37.5% | ArrayMath |
| Edit Distance | Medium | 60.1% | 37.5% | StringDynamic Programming |
| Sort Colors | Medium | 69.1% | 37.5% | ArrayTwo PointersSorting |
| Subsets | Medium | 82.0% | 37.5% | ArrayBacktrackingBit Manipulation |
| Word Search | Medium | 46.8% | 37.5% | ArrayStringBacktracking+2 |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 37.5% | ArrayTwo Pointers |
| Remove Duplicates from Sorted List | Easy | 56.2% | 37.5% | Linked List |
| Largest Rectangle in Histogram | Hard | 49.3% | 37.5% | ArrayStackMonotonic Stack |
| Maximal Rectangle | Hard | 58.1% | 37.5% | ArrayDynamic ProgrammingStack+2 |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Reverse Linked List II | Medium | 51.0% | 37.5% | Linked List |
| Validate Binary Search Tree | Medium | 35.3% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Same Tree | Easy | 66.6% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 37.5% | ArrayDynamic Programming |
| Valid Palindrome | Easy | 52.8% | 37.5% | Two PointersString |
| Word Ladder | Hard | 44.9% | 37.5% | Hash TableStringBreadth-First Search |
| Surrounded Regions | Medium | 44.7% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Gas Station | Medium | 47.5% | 37.5% | ArrayGreedy |
| Single Number | Easy | 77.3% | 37.5% | ArrayBit Manipulation |
| Linked List Cycle | Easy | 53.9% | 37.5% | Hash TableLinked ListTwo Pointers |
| Reorder List | Medium | 64.6% | 37.5% | Linked ListTwo PointersStack+1 |
| Reverse Words in a String | Medium | 55.5% | 37.5% | Two PointersString |
| Min Stack | Medium | 57.7% | 37.5% | StackDesign |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 37.5% | ArrayTwo PointersBinary Search |
| Binary Search Tree Iterator | Medium | 76.1% | 37.5% | StackTreeDesign+3 |
| Employees Earning More Than Their Managers | Easy | 72.8% | 37.5% | Database |
| Rotate Array | Medium | 44.4% | 37.5% | ArrayMathTwo Pointers |
| Bitwise AND of Numbers Range | Medium | 48.6% | 37.5% | Bit Manipulation |
| Happy Number | Easy | 59.2% | 37.5% | Hash TableMathTwo Pointers |
| Count Primes | Medium | 35.7% | 37.5% | ArrayMathEnumeration+1 |
| 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 |
| Contains Duplicate | Easy | 64.1% | 37.5% | ArrayHash TableSorting |
| Basic Calculator II | Medium | 46.6% | 37.5% | MathStringStack |
| Majority Element II | Medium | 55.8% | 37.5% | ArrayHash TableSorting+1 |
| Palindrome Linked List | Easy | 57.4% | 37.5% | Linked ListTwo PointersStack+1 |
| Meeting Rooms II | Medium | 52.5% | 37.5% | |
| Missing Number | Easy | 71.6% | 37.5% | ArrayHash TableMath+3 |
| H-Index | Medium | 41.1% | 37.5% | ArraySortingCounting Sort |
| First Bad Version | Easy | 46.8% | 37.5% | Binary SearchInteractive |
| Perfect Squares | Medium | 56.3% | 37.5% | MathDynamic ProgrammingBreadth-First Search |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 37.5% | StringTreeDepth-First Search+3 |
| Remove Invalid Parentheses | Hard | 49.8% | 37.5% | StringBacktrackingBreadth-First Search |
| First Unique Character in a String | Easy | 65.0% | 37.5% | Hash TableStringQueue+1 |
| Decode String | Medium | 62.2% | 37.5% | StringStackRecursion |
| Remove K Digits | Medium | 36.4% | 37.5% | StringStackGreedy+1 |
| Pacific Atlantic Water Flow | Medium | 60.6% | 37.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Longest Repeating Character Replacement | Medium | 59.0% | 37.5% | Hash TableStringSliding Window |
| Find All Duplicates in an Array | Medium | 76.8% | 37.5% | ArrayHash TableSorting |
| String Compression | Medium | 59.5% | 37.5% | Two PointersString |
| Find All Numbers Disappeared in an Array | Easy | 63.7% | 37.5% | ArrayHash Table |
| Sort Characters By Frequency | Medium | 75.1% | 37.5% | Hash TableStringSorting+3 |
| Reverse Pairs | Hard | 33.7% | 37.5% | ArrayBinary SearchDivide and Conquer+4 |
| Swapping Nodes in a Linked List | Medium | 69.2% | 37.5% | Linked ListTwo Pointers |
| 01 Matrix | Medium | 53.3% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Diameter of Binary Tree | Easy | 65.0% | 37.5% | TreeDepth-First SearchBinary Tree |
| Next Greater Element III | Medium | 35.1% | 37.5% | MathTwo PointersString |
| Subarray Sum Equals K | Medium | 46.8% | 37.5% | ArrayHash TablePrefix Sum |
| Permutation in String | Medium | 48.4% | 37.5% | Hash TableTwo PointersString+1 |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 37.5% | ArrayTwo PointersStack+3 |
| Find Customer Referee | Easy | 72.6% | 37.5% | Database |
| Find K Closest Elements | Medium | 49.4% | 37.5% | ArrayTwo PointersBinary Search+3 |
| Count Binary Substrings | Easy | 70.2% | 37.5% | Two PointersString |
| Find Pivot Index | Easy | 62.1% | 37.5% | ArrayPrefix Sum |
| Reorganize String | Medium | 56.8% | 37.5% | Hash TableStringGreedy+3 |
| Search in a Binary Search Tree | Easy | 82.5% | 37.5% | TreeBinary Search TreeBinary Tree |
| Binary Search | Easy | 60.5% | 37.5% | ArrayBinary Search |
| Custom Sort String | Medium | 72.3% | 37.5% | Hash TableStringSorting |
| Shortest Path to Get All Keys | Hard | 54.3% | 37.5% | ArrayBit ManipulationBreadth-First Search+1 |
| Online Stock Span | Medium | 68.7% | 37.5% | StackDesignMonotonic Stack+1 |
| Binary Subarrays With Sum | Medium | 68.2% | 37.5% | ArrayHash TableSliding Window+1 |
| Bag of Tokens | Medium | 59.5% | 37.5% | ArrayTwo PointersGreedy+1 |
| Binary Tree Cameras | Hard | 47.6% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| K Closest Points to Origin | Medium | 68.7% | 37.5% | ArrayMathDivide and Conquer+4 |
| Subarray Sums Divisible by K | Medium | 56.0% | 37.5% | ArrayHash TablePrefix Sum |
| Squares of a Sorted Array | Easy | 73.6% | 37.5% | ArrayTwo PointersSorting |
| Subarrays with K Different Integers | Hard | 67.5% | 37.5% | ArrayHash TableSliding Window+1 |
| Cousins in Binary Tree | Easy | 59.1% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Longest Common Subsequence | Medium | 58.9% | 37.5% | StringDynamic Programming |
| Number of Dice Rolls With Target Sum | Medium | 62.2% | 37.5% | Dynamic Programming |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 37.5% | StringStack |
| Search Suggestions System | Medium | 65.2% | 37.5% | ArrayStringBinary Search+3 |
| Running Sum of 1d Array | Easy | 86.9% | 37.5% | ArrayPrefix Sum |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 37.5% | Database |
| Average Time of Process per Machine | Easy | 66.9% | 37.5% | Database |
| Invalid Tweets | Easy | 85.2% | 37.5% | Database |
| Sum of All Subset XOR Totals | Easy | 90.1% | 37.5% | ArrayMathBacktracking+3 |
| Add Two Integers | Easy | 87.9% | 37.5% | Math |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 37.5% | Hash TableTreeDepth-First Search+2 |
| To Be Or Not To Be | Easy | 63.3% | 37.5% | |
| Create a DataFrame from List | Easy | 81.1% | 37.5% | |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 37.5% | ArraySliding Window |
| Basic Calculator | Hard | 46.5% | 37.5% | MathStringStack+1 |
| Range Sum Query - Mutable | Medium | 42.6% | 37.5% | ArrayDivide and ConquerDesign+2 |
| Shopping Offers | Medium | 52.2% | 37.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Excel Sheet Column Number | Easy | 67.2% | 37.5% | MathString |
| Contiguous Array | Medium | 50.8% | 37.5% | ArrayHash TablePrefix Sum |
| Split the Array | Easy | 60.9% | 37.5% | ArrayHash TableCounting |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 37.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Max Area of Island | Medium | 73.8% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Jewels and Stones | Easy | 89.5% | 37.5% | Hash TableString |
| Design Twitter | Medium | 44.2% | 37.5% | Hash TableLinked ListDesign+1 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Increment Submatrices by One | Medium | 73.8% | 37.5% | ArrayMatrixPrefix Sum |
| Max Consecutive Ones III | Medium | 67.3% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Count Complete Tree Nodes | Easy | 72.0% | 37.5% | Binary SearchBit ManipulationTree+1 |
| Trim a Binary Search Tree | Medium | 66.6% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% | 37.5% | ArrayHash TableBit Manipulation+1 |
| Boundary of Binary Tree | Medium | 47.9% | 37.5% | |
| Unit Conversion I | Medium | 54.4% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Nested List Weight Sum | Medium | 85.9% | 37.5% | |
| Reformat Date | Easy | 68.2% | 37.5% | String |
| Contains Duplicate II | Easy | 50.8% | 37.5% | ArrayHash TableSliding Window |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 37.5% | Two PointersStringStack+1 |
| Maximum Profit From Trading Stocks | Medium | 48.0% | 37.5% | |
| Spiral Matrix II | Medium | 74.6% | 37.5% | ArrayMatrixSimulation |
| Counting Bits | Easy | 80.4% | 37.5% | Dynamic ProgrammingBit Manipulation |
| Is Subsequence | Easy | 48.8% | 37.5% | Two PointersStringDynamic Programming |
| Heaters | Medium | 41.4% | 37.5% | ArrayTwo PointersBinary Search+1 |
| Split Array Largest Sum | Hard | 59.8% | 37.5% | ArrayBinary SearchDynamic Programming+2 |