| Find the Smallest Divisor Given a Threshold | Medium | 65.5% | 100.0% | ArrayBinary Search |
| Valid Triangle Number | Medium | 56.7% | 95.6% | ArrayTwo PointersBinary Search+2 |
| The kth Factor of n | Medium | 70.2% | 95.6% | MathNumber Theory |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 93.2% | MathDynamic ProgrammingBit Manipulation+2 |
| Valid Word | Easy | 50.9% | 93.2% | String |
| Break a Palindrome | Medium | 51.6% | 93.2% | StringGreedy |
| Number of Good Binary Strings | Medium | 52.8% | 93.2% | Dynamic Programming |
| Most Visited Sector in a Circular Track | Easy | 59.8% | 93.2% | ArraySimulation |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 93.2% | ArrayMathGreedy |
| Minimum Swaps to Group All 1's Together | Medium | 61.2% | 93.2% | ArraySliding Window |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 93.2% | ArrayHash TableTwo Pointers+1 |
| Rearrange Words in a Sentence | Medium | 66.9% | 93.2% | StringSorting |
| String Compression | Medium | 59.6% | 93.2% | Two PointersString |
| The Earliest Moment When Everyone Become Friends | Medium | 65.9% | 93.2% | ArrayUnion-FindSorting |
| Unique Substrings With Equal Digit Frequency | Medium | 64.6% | 93.2% | Hash TableStringRolling Hash+2 |
| Remove Duplicate Letters | Medium | 52.8% | 83.9% | StringStackGreedy+1 |
| Group Anagrams | Medium | 72.2% | 79.8% | ArrayHash TableString+1 |
| Merge Intervals | Medium | 51.2% | 79.8% | ArraySorting |
| Remove Stones to Minimize the Total | Medium | 65.5% | 75.1% | ArrayGreedyHeap (Priority Queue) |
| Count and Say | Medium | 62.3% | 69.3% | String |
| Sliding Window Maximum | Hard | 48.5% | 69.3% | ArrayQueueSliding Window+2 |
| Find Pivot Index | Easy | 62.1% | 69.3% | ArrayPrefix Sum |
| Two Sum | Easy | 57.1% | 69.3% | ArrayHash Table |
| Valid Parentheses | Easy | 43.7% | 69.3% | StringStack |
| Minimum Number of Chairs in a Waiting Room | Easy | 79.2% | 69.3% | StringSimulation |
| Maximum Palindromes After Operations | Medium | 45.6% | 69.3% | ArrayHash TableString+3 |
| Count Vowel Substrings of a String | Easy | 72.9% | 69.3% | Hash TableString |
| House Robber | Medium | 52.9% | 61.8% | ArrayDynamic Programming |
| Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | 41.4% | 61.8% | ArrayGreedySorting |
| LRU Cache | Medium | 46.8% | 61.8% | Hash TableLinked ListDesign+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 61.8% | Hash TableStringSliding Window |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 61.8% | ArrayDynamic Programming |
| Trapping Rain Water | Hard | 66.8% | 61.8% | ArrayTwo PointersDynamic Programming+2 |
| Number of Visible People in a Queue | Hard | 72.4% | 61.8% | ArrayStackMonotonic Stack |
| Roman to Integer | Easy | 66.3% | 61.8% | Hash TableMathString |
| Flip String to Monotone Increasing | Medium | 61.9% | 61.8% | StringDynamic Programming |
| Number of Islands | Medium | 63.8% | 61.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Reorganize String | Medium | 56.8% | 61.8% | Hash TableStringGreedy+3 |
| Basic Calculator II | Medium | 46.7% | 51.4% | MathStringStack |
| LFU Cache | Hard | 48.6% | 51.4% | Hash TableLinked ListDesign+1 |
| Max Area of Island | Medium | 73.8% | 51.4% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Frequency Stack | Hard | 66.6% | 51.4% | Hash TableStackDesign+1 |
| Koko Eating Bananas | Medium | 49.7% | 51.4% | ArrayBinary Search |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 51.4% | ArrayBinary Search |
| Find the Index of the First Occurrence in a String | Easy | 46.3% | 51.4% | Two PointersStringString Matching |
| Degree of an Array | Easy | 58.2% | 51.4% | ArrayHash Table |
| Container With Most Water | Medium | 59.6% | 51.4% | ArrayTwo PointersGreedy |
| Generate Parentheses | Medium | 78.3% | 51.4% | StringDynamic ProgrammingBacktracking |
| Verify Preorder Sequence in Binary Search Tree | Medium | 51.7% | 51.4% | ArrayStackTree+4 |
| Kth Smallest Element in a BST | Medium | 76.5% | 51.4% | TreeDepth-First SearchBinary Search Tree+1 |
| Rotting Oranges | Medium | 58.2% | 51.4% | ArrayBreadth-First SearchMatrix |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 51.4% | Two PointersStringStack+1 |
| Validate Binary Search Tree | Medium | 35.4% | 51.4% | TreeDepth-First SearchBinary Search Tree+1 |
| Word Ladder | Hard | 44.9% | 51.4% | Hash TableStringBreadth-First Search |
| Cheapest Flights Within K Stops | Medium | 41.4% | 51.4% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Minimum Value to Get Positive Step by Step Sum | Easy | 64.6% | 51.4% | ArrayPrefix Sum |
| Maximum Points You Can Obtain from Cards | Medium | 57.3% | 51.4% | ArraySliding WindowPrefix Sum |
| Letter Combinations of a Phone Number | Medium | 65.5% | 51.4% | Hash TableStringBacktracking |
| K-diff Pairs in an Array | Medium | 45.6% | 51.4% | ArrayHash TableTwo Pointers+2 |
| Reformat Date | Easy | 68.3% | 51.4% | String |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 51.4% | ArrayGreedySorting+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 51.4% | ArrayBinary Search |
| Palindrome Pairs | Hard | 37.0% | 51.4% | ArrayHash TableString+2 |
| Max Consecutive Ones III | Medium | 67.3% | 51.4% | ArrayBinary SearchSliding Window+1 |