| Candy Crush | Medium | 77.3% | 100.0% | ArrayTwo PointersMatrix+1 |
| Reorganize String | Medium | 56.8% | 94.7% | Hash TableStringGreedy+3 |
| Number of Ways to Wear Different Hats to Each Other | Hard | 45.7% | 92.6% | ArrayDynamic ProgrammingBit Manipulation+1 |
| Text Justification | Hard | 50.5% | 89.4% | ArrayStringSimulation |
| Maximize Distance to Closest Person | Medium | 49.6% | 85.6% | Array |
| Task Scheduler | Medium | 62.7% | 85.6% | ArrayHash TableGreedy+3 |
| Course Schedule II | Medium | 55.0% | 83.4% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Design Hit Counter | Medium | 69.6% | 76.7% | ArrayBinary SearchDesign+2 |
| Design Search Autocomplete System | Hard | 49.7% | 73.2% | StringDepth-First SearchDesign+4 |
| Integer to English Words | Hard | 34.8% | 73.2% | MathStringRecursion |
| Count Number of Nice Subarrays | Medium | 74.8% | 73.2% | ArrayHash TableMath+2 |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 73.2% | ArrayHash TableGreedy |
| Rotate Image | Medium | 79.4% | 71.2% | ArrayMathMatrix |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 71.2% | Linked ListMath |
| Students and Examinations | Easy | 61.0% | 71.2% | Database |
| Magnetic Force Between Two Balls | Medium | 71.9% | 71.2% | ArrayBinary SearchSorting |
| Maximum Number of Occurrences of a Substring | Medium | 54.3% | 71.2% | Hash TableStringSliding Window |
| Number of Trusted Contacts of a Customer | Medium | 74.8% | 71.2% | Database |
| Subdomain Visit Count | Medium | 77.2% | 71.2% | ArrayHash TableString+1 |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 66.6% | ArrayHash TableMatrix+1 |
| Logger Rate Limiter | Easy | 76.8% | 63.8% | Hash TableDesignData Stream |
| Valid Parentheses | Easy | 43.7% | 63.8% | StringStack |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 63.8% | Hash TableStringDesign+1 |
| Minimum Absolute Difference Between Elements With Constraint | Medium | 37.2% | 63.8% | ArrayBinary SearchOrdered Set |
| Number of Black Blocks | Medium | 41.5% | 63.8% | ArrayHash TableEnumeration |
| Course Schedule | Medium | 50.8% | 60.7% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 60.7% | ArrayHash TableString+1 |
| Block Placement Queries | Hard | 18.4% | 56.9% | ArrayBinary SearchBinary Indexed Tree+2 |
| Subarrays with K Different Integers | Hard | 67.6% | 56.9% | ArrayHash TableSliding Window+1 |
| Number of Adjacent Elements With the Same Color | Medium | 58.1% | 56.9% | Array |
| Rotating the Box | Medium | 79.2% | 56.9% | ArrayTwo PointersMatrix |
| Brightest Position on Street | Medium | 60.6% | 56.9% | ArraySortingPrefix Sum+1 |
| Two Sum | Easy | 57.1% | 52.3% | ArrayHash Table |
| Merge Intervals | Medium | 51.2% | 52.3% | ArraySorting |
| Number of Flowers in Full Bloom | Hard | 57.7% | 52.3% | ArrayHash TableBinary Search+3 |
| Largest Rectangle in Histogram | Hard | 49.4% | 52.3% | ArrayStackMonotonic Stack |
| Spiral Matrix | Medium | 56.2% | 52.3% | ArrayMatrixSimulation |
| Trapping Rain Water | Hard | 66.8% | 52.3% | ArrayTwo PointersDynamic Programming+2 |
| Number of Recent Calls | Easy | 78.2% | 52.3% | DesignQueueData Stream |
| Design Browser History | Medium | 78.2% | 46.4% | ArrayLinked ListStack+3 |
| Longest Common Prefix | Easy | 47.1% | 46.4% | ArrayStringTrie |
| Count the Number of Good Subarrays | Medium | 65.9% | 46.4% | ArrayHash TableSliding Window |
| Length of Longest V-Shaped Diagonal Segment | Hard | 56.3% | 46.4% | ArrayDynamic ProgrammingMemoization+1 |
| Employee Free Time | Hard | 72.8% | 38.1% | ArraySweep LineSorting+1 |
| Rotting Oranges | Medium | 58.2% | 38.1% | ArrayBreadth-First SearchMatrix |
| Longest Consecutive Sequence | Medium | 47.0% | 38.1% | ArrayHash TableUnion-Find |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 38.1% | Hash TableStringSliding Window |
| Image Smoother | Easy | 69.1% | 38.1% | ArrayMatrix |
| Basic Calculator IV | Hard | 49.7% | 38.1% | Hash TableMathString+2 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 38.1% | ArrayHash TableMath+2 |
| Restore the Array From Adjacent Pairs | Medium | 75.1% | 38.1% | ArrayHash TableDepth-First Search |
| Count Nice Pairs in an Array | Medium | 48.4% | 38.1% | ArrayHash TableMath+1 |
| Minimum Number of Frogs Croaking | Medium | 51.1% | 38.1% | StringCounting |
| Random Pick with Weight | Medium | 48.9% | 38.1% | ArrayMathBinary Search+2 |
| Sliding Window Maximum | Hard | 48.5% | 38.1% | ArrayQueueSliding Window+2 |
| Design Memory Allocator | Medium | 49.7% | 38.1% | ArrayHash TableDesign+1 |