| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% | 100.0% | Dynamic ProgrammingGreedyBit Manipulation |
| String Compression | Medium | 59.5% | 87.5% | Two PointersString |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| LFU Cache | Hard | 48.6% | 75.0% | Hash TableLinked ListDesign+1 |
| Subarray Product Less Than K | Medium | 53.9% | 75.0% | ArrayBinary SearchSliding Window+1 |
| Remove Adjacent Almost-Equal Characters | Medium | 53.1% | 75.0% | StringDynamic ProgrammingGreedy |
| Maximum Number of Occurrences of a Substring | Medium | 54.2% | 75.0% | Hash TableStringSliding Window |
| Smallest Substring With Identical Characters I | Hard | 20.3% | 75.0% | ArrayBinary SearchEnumeration |
| Smallest Substring With Identical Characters II | Hard | 40.2% | 75.0% | StringBinary Search |
| Closest Equal Element Queries | Medium | 32.7% | 75.0% | ArrayHash TableBinary Search |
| Time Needed to Rearrange a Binary String | Medium | 52.6% | 75.0% | StringDynamic ProgrammingSimulation |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Distinct Subsequences | Hard | 51.5% | 62.5% | StringDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Check Whether Two Strings are Almost Equivalent | Easy | 64.1% | 62.5% | Hash TableStringCounting |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximum Product of Three Numbers | Easy | 45.7% | 62.5% | ArrayMathSorting |
| Palindromic Substrings | Medium | 72.5% | 62.5% | Two PointersStringDynamic Programming |
| Count the Number of Fair Pairs | Medium | 52.7% | 62.5% | ArrayTwo PointersBinary Search+1 |
| Maximum Frequency Stack | Hard | 66.6% | 62.5% | Hash TableStackDesign+1 |
| Beautiful Towers II | Medium | 36.2% | 62.5% | ArrayStackMonotonic Stack |
| Beautiful Towers I | Medium | 44.3% | 62.5% | ArrayStackMonotonic Stack |
| Check If a Number Is Majority Element in a Sorted Array | Easy | 59.9% | 62.5% | |
| Height Checker | Easy | 81.5% | 62.5% | ArraySortingCounting Sort |
| Matrix Similarity After Cyclic Shifts | Easy | 59.3% | 62.5% | ArrayMathMatrix+1 |
| Number of Self-Divisible Permutations | Medium | 71.7% | 62.5% | |
| Maximum Number That Makes Result of Bitwise AND Zero | Medium | 70.3% | 62.5% | |
| Find Subarray With Bitwise OR Closest to K | Hard | 30.8% | 62.5% | ArrayBinary SearchBit Manipulation+1 |
| Equalize Strings by Adding or Removing Characters at Ends | Medium | 56.6% | 62.5% | |
| Search Suggestions System | Medium | 65.2% | 62.5% | ArrayStringBinary Search+3 |
| Count the Number of Inversions | Hard | 29.7% | 62.5% | ArrayDynamic Programming |
| Find the Minimum Area to Cover All Ones II | Hard | 63.5% | 62.5% | ArrayMatrixEnumeration |
| Find the Minimum Area to Cover All Ones I | Medium | 78.2% | 62.5% | ArrayMatrix |
| Maximum Height of a Triangle | Easy | 44.1% | 62.5% | ArrayEnumeration |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Maximize Grid Happiness | Hard | 40.8% | 62.5% | Dynamic ProgrammingBit ManipulationMemoization+1 |
| Average Waiting Time | Medium | 73.1% | 62.5% | ArraySimulation |
| Minimize Malware Spread | Hard | 42.9% | 62.5% | ArrayHash TableDepth-First Search+3 |
| Find the Last Marked Nodes in Tree | Hard | 55.4% | 62.5% | |
| Split a String in Balanced Strings | Easy | 87.3% | 62.5% | StringGreedyCounting |
| Longest Common Subsequence | Medium | 58.9% | 62.5% | StringDynamic Programming |
| Minimum Time to Visit All Houses | Medium | 69.3% | 62.5% | |
| Power Grid Maintenance | Medium | 56.3% | 62.5% | ArrayHash TableDepth-First Search+5 |
| Minimize Maximum Component Cost | Medium | 43.4% | 62.5% | Binary SearchUnion-FindGraph Theory+1 |
| Delete and Earn | Medium | 57.1% | 62.5% | ArrayHash TableDynamic Programming |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| Integer to Roman | Medium | 70.4% | 50.0% | Hash TableMathString |
| Trapping Rain Water | Hard | 66.8% | 50.0% | ArrayTwo PointersDynamic Programming+2 |
| Minimum Window Substring | Hard | 46.9% | 50.0% | Hash TableStringSliding Window |
| Validate Binary Search Tree | Medium | 35.3% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 50.0% | ArrayDynamic Programming |
| Word Break | Medium | 49.1% | 50.0% | ArrayHash TableString+3 |
| Min Stack | Medium | 57.7% | 50.0% | StackDesign |
| Kth Largest Element in an Array | Medium | 68.8% | 50.0% | ArrayDivide and ConquerSorting+2 |
| Maximal Square | Medium | 50.0% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Coin Change | Medium | 47.9% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Design a Text Editor | Hard | 49.9% | 50.0% | Linked ListStringStack+3 |
| Top K Frequent Elements | Medium | 65.8% | 50.0% | ArrayHash TableDivide and Conquer+5 |
| Count Palindromic Subsequences | Hard | 41.0% | 50.0% | StringDynamic Programming |
| Maximize Greatness of an Array | Medium | 61.2% | 50.0% | ArrayTwo PointersGreedy+1 |
| Count Binary Substrings | Easy | 70.2% | 50.0% | Two PointersString |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Sum of Nodes with Even-Valued Grandparent | Medium | 85.9% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 50.0% | ArrayGreedySorting |
| Number of Digit One | Hard | 37.7% | 50.0% | MathDynamic ProgrammingRecursion |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Magnetic Force Between Two Balls | Medium | 71.9% | 50.0% | ArrayBinary SearchSorting |
| Maximum Units on a Truck | Easy | 74.6% | 50.0% | ArrayGreedySorting |
| Largest Number After Digit Swaps by Parity | Easy | 65.0% | 50.0% | SortingHeap (Priority Queue) |
| Number of Divisible Triplet Sums | Medium | 67.6% | 50.0% | |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| K-diff Pairs in an Array | Medium | 45.6% | 50.0% | ArrayHash TableTwo Pointers+2 |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Reverse Nodes in k-Group | Hard | 65.3% | 50.0% | Linked ListRecursion |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 50.0% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Minimum Absolute Difference | Easy | 75.0% | 50.0% | ArraySorting |
| Gas Station | Medium | 47.5% | 50.0% | ArrayGreedy |
| Zigzag Conversion | Medium | 53.5% | 50.0% | String |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 50.0% | Hash TableTreeDepth-First Search+2 |
| Count Subarrays With Median K | Hard | 47.6% | 50.0% | ArrayHash TablePrefix Sum |
| Report Spam Message | Medium | 48.5% | 50.0% | ArrayHash TableString |
| Boundary of Binary Tree | Medium | 47.9% | 50.0% | |
| Odd String Difference | Easy | 61.8% | 50.0% | ArrayHash TableString |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| 3Sum | Medium | 38.6% | 37.5% | ArrayTwo PointersSorting |
| Valid Parentheses | Easy | 43.7% | 37.5% | StringStack |
| Merge k Sorted Lists | Hard | 58.8% | 37.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 37.5% | ArrayBinary Search |
| First Missing Positive | Hard | 42.4% | 37.5% | ArrayHash Table |
| Sort Colors | Medium | 69.1% | 37.5% | ArrayTwo PointersSorting |
| Product of Array Except Self | Medium | 68.6% | 37.5% | ArrayPrefix Sum |
| Meeting Rooms II | Medium | 52.5% | 37.5% | |
| Move Zeroes | Easy | 63.5% | 37.5% | ArrayTwo Pointers |
| Find Median from Data Stream | Hard | 54.2% | 37.5% | Two PointersDesignSorting+2 |
| Decode String | Medium | 62.2% | 37.5% | StringStackRecursion |
| Split Array Largest Sum | Hard | 59.8% | 37.5% | ArrayBinary SearchDynamic Programming+2 |
| Daily Temperatures | Medium | 68.3% | 37.5% | ArrayStackMonotonic Stack |
| Rotting Oranges | Medium | 58.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| The kth Factor of n | Medium | 70.2% | 37.5% | MathNumber Theory |
| Word Ladder | Hard | 44.9% | 37.5% | Hash TableStringBreadth-First Search |
| Top K Frequent Words | Medium | 60.0% | 37.5% | ArrayHash TableString+5 |
| Verify Preorder Sequence in Binary Search Tree | Medium | 51.7% | 37.5% | |
| Find Leaves of Binary Tree | Medium | 81.3% | 37.5% | |
| Longest Increasing Subsequence | Medium | 59.0% | 37.5% | ArrayBinary SearchDynamic Programming |
| Sliding Window Maximum | Hard | 48.4% | 37.5% | ArrayQueueSliding Window+2 |
| Number of Visible People in a Queue | Hard | 72.3% | 37.5% | ArrayStackMonotonic Stack |
| Max Consecutive Ones III | Medium | 67.3% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Median of Two Sorted Arrays | Hard | 45.9% | 37.5% | ArrayBinary SearchDivide and Conquer |
| Koko Eating Bananas | Medium | 49.7% | 37.5% | ArrayBinary Search |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 37.5% | ArrayDynamic Programming |
| Optimal Account Balancing | Hard | 50.3% | 37.5% | |
| Merge Two Sorted Lists | Easy | 67.9% | 37.5% | Linked ListRecursion |
| Valid Palindrome | Easy | 52.8% | 37.5% | Two PointersString |
| All Possible Full Binary Trees | Medium | 82.8% | 37.5% | Dynamic ProgrammingTreeRecursion+2 |
| Subarrays with K Different Integers | Hard | 67.5% | 37.5% | ArrayHash TableSliding Window+1 |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 37.5% | StringStack |
| Network Delay Time | Medium | 59.7% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Reconstruct Itinerary | Hard | 44.3% | 37.5% | ArrayStringDepth-First Search+4 |
| Missing Number | Easy | 71.6% | 37.5% | ArrayHash TableMath+3 |
| Path with Maximum Gold | Medium | 68.3% | 37.5% | ArrayBacktrackingMatrix |
| Design Twitter | Medium | 44.2% | 37.5% | Hash TableLinked ListDesign+1 |
| Diameter of N-Ary Tree | Medium | 75.4% | 37.5% | |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 37.5% | ArrayQueueSliding Window+3 |
| Course Schedule | Medium | 50.8% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Combination Sum | Medium | 76.1% | 25.0% | ArrayBacktracking |
| Pow(x, n) | Medium | 38.2% | 25.0% | MathRecursion |
| N-Queens | Hard | 74.9% | 25.0% | ArrayBacktracking |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 25.0% | ArrayTwo PointersBinary Search+5 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 25.0% | TreeDepth-First SearchBinary Tree |
| Range Addition | Medium | 72.9% | 25.0% | |
| Task Scheduler | Medium | 62.6% | 25.0% | ArrayHash TableGreedy+3 |
| Count the Number of Infection Sequences | Hard | 37.2% | 25.0% | ArrayMathCombinatorics |
| Target Sum | Medium | 51.8% | 25.0% | ArrayDynamic ProgrammingBacktracking |
| Masking Personal Information | Medium | 53.9% | 25.0% | String |
| Maximum Product Subarray | Medium | 36.0% | 25.0% | ArrayDynamic Programming |
| Maximum Number of Ways to Partition an Array | Hard | 35.4% | 25.0% | ArrayHash TableCounting+2 |
| Concatenated Words | Hard | 49.7% | 25.0% | ArrayStringDynamic Programming+3 |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 25.0% | Two PointersStringDynamic Programming+1 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 25.0% | Hash TableStringBacktracking |
| Basic Calculator | Hard | 46.5% | 25.0% | MathStringStack+1 |
| K Closest Points to Origin | Medium | 68.7% | 25.0% | ArrayMathDivide and Conquer+4 |
| Exclusive Time of Functions | Medium | 66.1% | 25.0% | ArrayStack |
| Shortest Distance to Target String in a Circular Array | Easy | 50.6% | 25.0% | ArrayString |
| Game of Life | Medium | 72.3% | 25.0% | ArrayMatrixSimulation |
| Reorganize String | Medium | 56.8% | 25.0% | Hash TableStringGreedy+3 |
| Last Stone Weight | Easy | 66.3% | 25.0% | ArrayHeap (Priority Queue) |
| Path Sum III | Medium | 46.3% | 25.0% | TreeDepth-First SearchBinary Tree |
| Paths in Maze That Lead to Same Room | Medium | 56.5% | 25.0% | |
| Candy | Hard | 47.9% | 25.0% | ArrayGreedy |
| Maximum Earnings From Taxi | Medium | 46.2% | 25.0% | ArrayHash TableBinary Search+2 |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 25.0% | ArrayHash TableGreedy+2 |
| Backspace String Compare | Easy | 49.8% | 25.0% | Two PointersStringStack+1 |
| Design Snake Game | Medium | 40.0% | 25.0% | |
| Find Pivot Index | Easy | 62.1% | 25.0% | ArrayPrefix Sum |
| Find Peak Element | Medium | 46.8% | 25.0% | ArrayBinary Search |
| Encode and Decode TinyURL | Medium | 86.6% | 25.0% | Hash TableStringDesign+1 |
| Max Chunks To Make Sorted II | Hard | 54.7% | 25.0% | ArrayStackGreedy+2 |
| Bus Routes | Hard | 47.1% | 25.0% | ArrayHash TableBreadth-First Search |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 25.0% | ArrayGreedy |
| Maximal Rectangle | Hard | 58.1% | 25.0% | ArrayDynamic ProgrammingStack+2 |
| House Robber III | Medium | 55.6% | 25.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Finding the Number of Visible Mountains | Medium | 37.2% | 25.0% | |
| Number of Operations to Make Network Connected | Medium | 66.1% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Kth Largest Element in a Stream | Easy | 60.7% | 25.0% | TreeDesignBinary Search Tree+3 |
| Find Duplicate Subtrees | Medium | 60.6% | 25.0% | Hash TableTreeDepth-First Search+1 |
| Course Schedule III | Hard | 41.4% | 25.0% | ArrayGreedySorting+1 |
| House Robber II | Medium | 44.6% | 25.0% | ArrayDynamic Programming |
| IPO | Hard | 53.3% | 25.0% | ArrayGreedySorting+1 |
| Maximum Path Quality of a Graph | Hard | 61.6% | 25.0% | ArrayBacktrackingGraph Theory |
| Partition Equal Subset Sum | Medium | 49.2% | 25.0% | ArrayDynamic Programming |
| Valid Parenthesis String | Medium | 39.8% | 25.0% | StringDynamic ProgrammingStack+1 |
| Tree Diameter | Medium | 61.2% | 25.0% | |
| Binary Tree Preorder Traversal | Easy | 75.1% | 25.0% | StackTreeDepth-First Search+1 |
| Cherry Pickup II | Hard | 72.3% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 25.0% | Hash TableStringStack+1 |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 25.0% | Hash TableStringStack+2 |
| Shortest Bridge | Medium | 59.3% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Count Vowel Substrings of a String | Easy | 72.8% | 25.0% | Hash TableString |
| Spiral Matrix | Medium | 56.1% | 25.0% | ArrayMatrixSimulation |
| Longest Substring Of All Vowels in Order | Medium | 51.5% | 25.0% | StringSliding Window |
| Find the Duplicate Number | Medium | 64.0% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Minimum Array Sum | Medium | 30.9% | 25.0% | ArrayDynamic Programming |
| Collect Coins in a Tree | Hard | 39.6% | 25.0% | ArrayTreeGraph Theory+1 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 25.0% | ArrayHash TableDivide and Conquer+2 |
| Maximum Palindromes After Operations | Medium | 45.6% | 25.0% | ArrayHash TableString+3 |