| Maximum Tastiness of Candy Basket | Medium | 67.9% | 100.0% | ArrayBinary SearchGreedy+1 |
| Check if Point Is Reachable | Hard | 44.8% | 100.0% | MathNumber Theory |
| Simple Bank System | Medium | 69.8% | 100.0% | ArrayHash TableDesign+1 |
| Smallest String With Swaps | Medium | 60.3% | 100.0% | ArrayHash TableString+4 |
| Viewers Turned Streamers | Hard | 42.7% | 100.0% | |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% | 100.0% | Two PointersStringBinary Search+3 |
| Smallest Range Covering Elements from K Lists | Hard | 70.0% | 100.0% | ArrayHash TableGreedy+3 |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 100.0% | MathCombinatorics |
| Maximum Amount of Money Robot Can Earn | Medium | 29.5% | 100.0% | ArrayDynamic ProgrammingMatrix |
| Frequencies of Shortest Supersequences | Hard | 22.0% | 100.0% | ArrayStringBit Manipulation+3 |
| Longest Palindromic Substring | Medium | 37.3% | 87.5% | Two PointersStringDynamic Programming |
| Remove K Digits | Medium | 36.4% | 87.5% | StringStackGreedy+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 87.5% | Hash TableDepth-First SearchUnion-Find+1 |
| Minimum Number of Days to Make m Bouquets | Medium | 56.2% | 87.5% | ArrayBinary Search |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 75.0% | ArrayQueueSliding Window+3 |
| Trapping Rain Water | Hard | 66.8% | 75.0% | ArrayTwo PointersDynamic Programming+2 |
| Jump Game II | Medium | 42.5% | 75.0% | ArrayDynamic ProgrammingGreedy |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| Candy | Hard | 47.9% | 75.0% | ArrayGreedy |
| House Robber | Medium | 52.9% | 75.0% | ArrayDynamic Programming |
| Bus Routes | Hard | 47.1% | 75.0% | ArrayHash TableBreadth-First Search |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 75.0% | ArrayBinary SearchDynamic Programming+1 |
| Decoded String at Index | Medium | 37.2% | 75.0% | StringStack |
| Queue Reconstruction by Height | Medium | 74.6% | 75.0% | ArrayBinary Indexed TreeSegment Tree+1 |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% | 75.0% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Sum of Distances in Tree | Hard | 65.5% | 75.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Rotting Oranges | Medium | 58.1% | 75.0% | ArrayBreadth-First SearchMatrix |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 75.0% | ArrayBinary SearchSorting+2 |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.2% | 75.0% | ArrayUnion-FindSorting |
| Matchsticks to Square | Medium | 41.6% | 75.0% | ArrayDynamic ProgrammingBacktracking+2 |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| Zuma Game | Hard | 30.2% | 75.0% | StringDynamic ProgrammingStack+2 |
| Distribute Candies Among Children II | Medium | 55.7% | 75.0% | MathCombinatoricsEnumeration |
| Collect Coins in a Tree | Hard | 39.6% | 75.0% | ArrayTreeGraph Theory+1 |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Word Ladder | Hard | 44.9% | 62.5% | Hash TableStringBreadth-First Search |
| Burst Balloons | Hard | 62.9% | 62.5% | ArrayDynamic Programming |
| House Robber III | Medium | 55.6% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Koko Eating Bananas | Medium | 49.7% | 62.5% | ArrayBinary Search |
| Frequency of the Most Frequent Element | Medium | 44.6% | 62.5% | ArrayBinary SearchGreedy+3 |
| Make Sum Divisible by P | Medium | 42.6% | 62.5% | ArrayHash TablePrefix Sum |
| Maximal Square | Medium | 50.0% | 62.5% | ArrayDynamic ProgrammingMatrix |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 62.5% | ArrayHash TableTwo Pointers+4 |
| Split Array into Consecutive Subsequences | Medium | 52.0% | 62.5% | ArrayHash TableGreedy+1 |
| Asteroid Collision | Medium | 47.1% | 62.5% | ArrayStackSimulation |
| Insert Interval | Medium | 44.7% | 62.5% | Array |
| Maximum Performance of a Team | Hard | 47.7% | 62.5% | ArrayGreedySorting+1 |
| Ways to Make a Fair Array | Medium | 66.3% | 62.5% | ArrayPrefix Sum |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Number of Flowers in Full Bloom | Hard | 57.7% | 62.5% | ArrayHash TableBinary Search+3 |
| Loud and Rich | Medium | 63.2% | 62.5% | ArrayDepth-First SearchGraph Theory+1 |
| Determine if Two Strings Are Close | Medium | 54.2% | 62.5% | Hash TableStringSorting+1 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.2% | 62.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Number of Operations to Make Network Connected | Medium | 66.1% | 62.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Gas Station | Medium | 47.5% | 62.5% | ArrayGreedy |
| Furthest Building You Can Reach | Medium | 50.7% | 62.5% | ArrayGreedyHeap (Priority Queue) |
| 3Sum | Medium | 38.6% | 62.5% | ArrayTwo PointersSorting |
| Sort Colors | Medium | 69.1% | 50.0% | ArrayTwo PointersSorting |
| Copy List with Random Pointer | Medium | 62.4% | 50.0% | Hash TableLinked List |
| Accounts Merge | Medium | 60.9% | 50.0% | ArrayHash TableString+4 |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Complete Binary Tree Inserter | Medium | 65.0% | 50.0% | TreeBreadth-First SearchDesign+1 |
| IPO | Hard | 53.3% | 50.0% | ArrayGreedySorting+1 |
| Decode Ways II | Hard | 31.7% | 50.0% | StringDynamic Programming |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 50.0% | ArrayHash TableString+2 |
| Walking Robot Simulation | Medium | 58.4% | 50.0% | ArrayHash TableSimulation |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 50.0% | ArrayDynamic ProgrammingStack+2 |
| Apply Operations to Maximize Frequency Score | Hard | 38.5% | 50.0% | ArrayBinary SearchSliding Window+2 |
| Find the Celebrity | Medium | 48.9% | 50.0% | |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Find Duplicate Subtrees | Medium | 60.6% | 50.0% | Hash TableTreeDepth-First Search+1 |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| First Missing Positive | Hard | 42.4% | 50.0% | ArrayHash Table |
| Heaters | Medium | 41.4% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Evaluate Division | Medium | 64.0% | 50.0% | ArrayStringDepth-First Search+4 |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Shortest Cycle in a Graph | Hard | 39.1% | 50.0% | Breadth-First SearchGraph Theory |
| Count Palindromic Subsequences | Hard | 41.0% | 50.0% | StringDynamic Programming |
| Minimum Time for K Connected Components | Medium | 45.1% | 50.0% | Binary SearchUnion-FindGraph Theory+1 |
| Longest Cycle in a Graph | Hard | 50.4% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Freedom Trail | Hard | 59.2% | 50.0% | StringDynamic ProgrammingDepth-First Search+1 |
| Continuous Subarray Sum | Medium | 31.2% | 50.0% | ArrayHash TableMath+1 |
| Shortest Path to Get All Keys | Hard | 54.3% | 50.0% | ArrayBit ManipulationBreadth-First Search+1 |
| Remove Boxes | Hard | 49.3% | 50.0% | ArrayDynamic ProgrammingMemoization |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| 01 Matrix | Medium | 53.3% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Sum of Subarray Ranges | Medium | 60.7% | 50.0% | ArrayStackMonotonic Stack |
| Uncrossed Lines | Medium | 65.0% | 50.0% | ArrayDynamic Programming |
| Valid Parentheses | Easy | 43.7% | 50.0% | StringStack |
| Coin Change | Medium | 47.9% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Car Fleet | Medium | 54.7% | 50.0% | ArrayStackSorting+1 |
| Cherry Pickup | Hard | 39.1% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 50.0% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 50.0% | Hash TableStringBacktracking |
| Task Scheduler | Medium | 62.6% | 50.0% | ArrayHash TableGreedy+3 |
| Bricks Falling When Hit | Hard | 36.9% | 50.0% | ArrayUnion-FindMatrix |
| Number of Islands | Medium | 63.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |