| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Palindrome Number | Easy | 60.2% | 87.5% | Math |
| Longest Palindromic Substring | Medium | 37.3% | 75.0% | Two PointersStringDynamic Programming |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Largest Number After Mutating Substring | Medium | 37.8% | 75.0% | ArrayStringGreedy |
| Next Permutation | Medium | 44.7% | 75.0% | ArrayTwo Pointers |
| Maximum Subarray | Medium | 53.0% | 75.0% | ArrayDivide and ConquerDynamic Programming |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 75.0% | ArrayBinary SearchStack+4 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| Gas Station | Medium | 47.5% | 75.0% | ArrayGreedy |
| Second Highest Salary | Medium | 46.3% | 75.0% | Database |
| Longest Well-Performing Interval | Medium | 37.0% | 75.0% | ArrayHash TableStack+2 |
| Maximum Product After K Increments | Medium | 43.1% | 75.0% | ArrayGreedyHeap (Priority Queue) |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% | 75.0% | ArrayDivide and ConquerDynamic Programming+1 |
| Count the Number of Ideal Arrays | Hard | 56.9% | 75.0% | MathDynamic ProgrammingCombinatorics+1 |
| Maximum Segment Sum After Removals | Hard | 49.3% | 75.0% | ArrayUnion-FindPrefix Sum+1 |
| Sort the People | Easy | 84.8% | 75.0% | ArrayHash TableString+1 |
| Minimum Addition to Make Integer Beautiful | Medium | 38.5% | 75.0% | MathGreedy |
| Minimum Total Distance Traveled | Hard | 58.8% | 75.0% | ArrayDynamic ProgrammingSorting |
| Number of Nodes With Value One | Medium | 66.2% | 75.0% | |
| Can Convert String in K Moves | Medium | 37.0% | 75.0% | Hash TableString |
| The Number of Beautiful Subsets | Medium | 50.9% | 75.0% | ArrayHash TableMath+4 |
| Minimum Reverse Operations | Hard | 16.6% | 75.0% | ArrayHash TableBreadth-First Search+2 |
| Determine the Minimum Sum of a k-avoiding Array | Medium | 60.5% | 75.0% | MathGreedy |
| Maximum Number of Consecutive Values You Can Make | Medium | 63.5% | 75.0% | ArrayGreedySorting |
| Number of Beautiful Integers in the Range | Hard | 21.6% | 75.0% | MathDynamic Programming |
| Find the Minimum Possible Sum of a Beautiful Array | Medium | 35.2% | 75.0% | MathGreedy |
| Stone Game VIII | Hard | 53.9% | 75.0% | ArrayMathDynamic Programming+2 |
| Find the Number of Subsequences With Equal GCD | Hard | 31.4% | 75.0% | ArrayMathDynamic Programming+1 |
| Subarray Sum Equals K | Medium | 46.8% | 75.0% | ArrayHash TablePrefix Sum |
| Maximize the Minimum Game Score | Hard | 26.0% | 75.0% | ArrayBinary SearchGreedy |
| Eat Pizzas! | Medium | 33.1% | 75.0% | ArrayGreedySorting |
| Transform Array by Parity | Easy | 89.7% | 75.0% | ArraySortingCounting |
| Maximum Good Subtree Score | Hard | 45.4% | 75.0% | ArrayDynamic ProgrammingBit Manipulation+3 |
| Trionic Array II | Hard | 47.3% | 75.0% | ArrayDynamic Programming |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| 3Sum | Medium | 38.6% | 62.5% | ArrayTwo PointersSorting |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 62.5% | ArrayTwo Pointers |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| Merge Sorted Array | Easy | 54.4% | 62.5% | ArrayTwo PointersSorting |
| Rotate Array | Medium | 44.4% | 62.5% | ArrayMathTwo Pointers |
| House Robber | Medium | 52.9% | 62.5% | ArrayDynamic Programming |
| Fibonacci Number | Easy | 73.9% | 62.5% | MathDynamic ProgrammingRecursion+1 |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Rotate Image | Medium | 79.3% | 62.5% | ArrayMathMatrix |
| Generate Parentheses | Medium | 78.2% | 62.5% | StringDynamic ProgrammingBacktracking |
| Valid Anagram | Easy | 67.8% | 62.5% | Hash TableStringSorting |
| 4Sum | Medium | 40.0% | 62.5% | ArrayTwo PointersSorting |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Linked List Cycle | Easy | 53.9% | 62.5% | Hash TableLinked ListTwo Pointers |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Trionic Array I | Easy | 49.5% | 62.5% | Array |
| XOR After Range Multiplication Queries I | Medium | 73.9% | 62.5% | ArrayDivide and ConquerSimulation |
| XOR After Range Multiplication Queries II | Hard | 37.2% | 62.5% | ArrayDivide and Conquer |
| Sum of Beautiful Subsequences | Hard | 31.2% | 62.5% | ArrayMathBinary Indexed Tree+1 |
| Maximum Walls Destroyed by Robots | Hard | 26.4% | 62.5% | ArrayBinary SearchDynamic Programming+1 |
| Remove Digit From Number to Maximize Result | Easy | 48.2% | 62.5% | StringGreedyEnumeration |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Reverse Integer | Medium | 31.5% | 50.0% | Math |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| Merge Two Sorted Lists | Easy | 67.9% | 50.0% | Linked ListRecursion |
| Reverse Nodes in k-Group | Hard | 65.3% | 50.0% | Linked ListRecursion |
| Edit Distance | Medium | 60.1% | 50.0% | StringDynamic Programming |
| Number of Islands | Medium | 63.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Reverse String | Easy | 80.5% | 50.0% | Two PointersString |
| Sqrt(x) | Easy | 41.4% | 50.0% | MathBinary Search |
| Average Time of Process per Machine | Easy | 66.9% | 50.0% | Database |
| Valid Palindrome | Easy | 52.8% | 50.0% | Two PointersString |
| Kth Largest Element in an Array | Medium | 68.8% | 50.0% | ArrayDivide and ConquerSorting+2 |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 50.0% | ArrayTwo PointersBinary Search |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Reverse Words in a String | Medium | 55.5% | 50.0% | Two PointersString |
| Maximum Depth of Binary Tree | Easy | 77.9% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Merge Intervals | Medium | 51.1% | 50.0% | ArraySorting |
| Minimum Window Substring | Hard | 46.9% | 50.0% | Hash TableStringSliding Window |
| Subsets | Medium | 82.0% | 50.0% | ArrayBacktrackingBit Manipulation |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Binary Search | Easy | 60.5% | 50.0% | ArrayBinary Search |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Linked List Cycle II | Medium | 57.2% | 50.0% | Hash TableLinked ListTwo Pointers |
| Range Sum Query - Immutable | Easy | 71.4% | 50.0% | ArrayDesignPrefix Sum |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.9% | 50.0% | ArrayDynamic ProgrammingHeap (Priority Queue) |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Reverse Linked List II | Medium | 51.0% | 50.0% | Linked List |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Longest Increasing Subsequence | Medium | 59.0% | 50.0% | ArrayBinary SearchDynamic Programming |
| Frequency of the Most Frequent Element | Medium | 44.6% | 50.0% | ArrayBinary SearchGreedy+3 |
| Integer to Roman | Medium | 70.4% | 37.5% | Hash TableMathString |
| Combination Sum | Medium | 76.1% | 37.5% | ArrayBacktracking |
| Missing Number | Easy | 71.6% | 37.5% | ArrayHash TableMath+3 |
| Maximum Score Words Formed by Letters | Hard | 81.6% | 37.5% | ArrayHash TableString+5 |
| Car Fleet | Medium | 54.7% | 37.5% | ArrayStackSorting+1 |
| Koko Eating Bananas | Medium | 49.7% | 37.5% | ArrayBinary Search |
| Combination Sum II | Medium | 59.0% | 37.5% | ArrayBacktracking |
| Rearrange Array Elements by Sign | Medium | 84.5% | 37.5% | ArrayTwo PointersSimulation |
| Sort an Array | Medium | 55.9% | 37.5% | ArrayDivide and ConquerSorting+5 |
| Replace Employee ID With The Unique Identifier | Easy | 83.5% | 37.5% | Database |
| Median of Two Sorted Arrays | Hard | 45.9% | 37.5% | ArrayBinary SearchDivide and Conquer |
| Find the Index of the First Occurrence in a String | Easy | 46.2% | 37.5% | Two PointersStringString Matching |
| String to Integer (atoi) | Medium | 20.6% | 37.5% | String |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Kids With the Greatest Number of Candies | Easy | 88.0% | 37.5% | Array |
| Implement Queue using Stacks | Easy | 69.3% | 37.5% | StackDesignQueue |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 37.5% | ArrayBinary Search |
| Delete Duplicate Emails | Easy | 65.6% | 37.5% | Database |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 37.5% | ArrayBinary Search |
| Subarrays with K Different Integers | Hard | 67.5% | 37.5% | ArrayHash TableSliding Window+1 |
| Intersection of Two Arrays | Easy | 77.5% | 37.5% | ArrayHash TableTwo Pointers+2 |
| Next Greater Element III | Medium | 35.1% | 37.5% | MathTwo PointersString |
| Count Pairs That Form a Complete Day I | Easy | 78.0% | 37.5% | ArrayHash TableCounting |
| Palindrome Linked List | Easy | 57.4% | 37.5% | Linked ListTwo PointersStack+1 |
| Is Subsequence | Easy | 48.8% | 37.5% | Two PointersStringDynamic Programming |
| Pascal's Triangle | Easy | 78.7% | 37.5% | ArrayDynamic Programming |
| Delete Operation for Two Strings | Medium | 65.2% | 37.5% | StringDynamic Programming |
| Reverse String II | Easy | 53.3% | 37.5% | Two PointersString |
| Count Good Numbers | Medium | 57.4% | 37.5% | MathRecursion |
| Sliding Window Maximum | Hard | 48.4% | 37.5% | ArrayQueueSliding Window+2 |
| Maximum Product of Three Numbers | Easy | 45.7% | 37.5% | ArrayMathSorting |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 37.5% | ArrayGreedySorting+1 |
| Delete Node in a BST | Medium | 54.2% | 37.5% | TreeBinary Search TreeBinary Tree |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 37.5% | ArrayTwo PointersBinary Search+5 |
| Remove All Occurrences of a Substring | Medium | 78.4% | 37.5% | StringStackSimulation |
| Combinations | Medium | 74.2% | 37.5% | Backtracking |
| Pow(x, n) | Medium | 38.2% | 37.5% | MathRecursion |
| Car Pooling | Medium | 56.2% | 37.5% | ArraySortingHeap (Priority Queue)+2 |
| Find Sum of Array Product of Magical Sequences | Hard | 62.0% | 37.5% | ArrayMathDynamic Programming+3 |
| Longest Palindromic Subsequence | Medium | 65.1% | 37.5% | StringDynamic Programming |
| Maximum Sum Circular Subarray | Medium | 49.4% | 37.5% | ArrayDivide and ConquerDynamic Programming+2 |
| Maximum Number of K-Divisible Components | Hard | 74.1% | 37.5% | TreeDepth-First Search |
| Concatenation of Array | Easy | 90.5% | 37.5% | ArraySimulation |
| Subsets II | Medium | 60.9% | 37.5% | ArrayBacktrackingBit Manipulation |
| Add Digits | Easy | 68.6% | 37.5% | MathSimulationNumber Theory |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 37.5% | ArrayBinary SearchDynamic Programming+1 |
| Bulb Switcher | Medium | 55.5% | 37.5% | MathBrainteaser |
| Magic Squares In Grid | Medium | 55.1% | 37.5% | ArrayHash TableMath+1 |
| Triangle | Medium | 59.8% | 37.5% | ArrayDynamic Programming |
| Substring with Concatenation of All Words | Hard | 34.0% | 37.5% | Hash TableStringSliding Window |
| Reorder List | Medium | 64.6% | 37.5% | Linked ListTwo PointersStack+1 |
| Reorganize String | Medium | 56.8% | 37.5% | Hash TableStringGreedy+3 |
| Wildcard Matching | Hard | 31.3% | 37.5% | StringDynamic ProgrammingGreedy+1 |
| Number of Different Subsequences GCDs | Hard | 44.9% | 37.5% | ArrayMathCounting+1 |
| Contiguous Array | Medium | 50.8% | 37.5% | ArrayHash TablePrefix Sum |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 37.5% | ArrayMathStack |
| Largest Rectangle in Histogram | Hard | 49.3% | 37.5% | ArrayStackMonotonic Stack |
| Zigzag Conversion | Medium | 53.5% | 37.5% | String |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Palindrome Partitioning | Medium | 73.7% | 37.5% | StringDynamic ProgrammingBacktracking |
| Squares of a Sorted Array | Easy | 73.6% | 37.5% | ArrayTwo PointersSorting |
| House Robber II | Medium | 44.6% | 37.5% | ArrayDynamic Programming |
| Power of Two | Easy | 49.8% | 37.5% | MathBit ManipulationRecursion |