| Frog Jump | Hard | 47.1% | 100.0% | ArrayDynamic Programming |
| Burst Balloons | Hard | 63.0% | 94.2% | ArrayDynamic Programming |
| Decoded String at Index | Medium | 37.3% | 90.7% | StringStack |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 86.6% | ArrayHash TableGreedy+3 |
| Simple Bank System | Medium | 69.8% | 86.6% | ArrayHash TableDesign+1 |
| Maximum Tastiness of Candy Basket | Medium | 67.9% | 86.6% | ArrayBinary SearchGreedy+1 |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 84.3% | MathCombinatorics |
| Maximum Amount of Money Robot Can Earn | Medium | 29.5% | 84.3% | ArrayDynamic ProgrammingMatrix |
| Frequencies of Shortest Supersequences | Hard | 22.0% | 84.3% | ArrayStringBit Manipulation+3 |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% | 84.3% | Two PointersStringBinary Search+3 |
| Viewers Turned Streamers | Hard | 42.7% | 84.3% | Database |
| Check if Point Is Reachable | Hard | 44.8% | 84.3% | MathNumber Theory |
| Smallest String With Swaps | Medium | 60.4% | 84.3% | ArrayHash TableString+4 |
| Remove K Digits | Medium | 36.4% | 78.8% | StringStackGreedy+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 75.5% | Hash TableDepth-First SearchUnion Find+1 |
| Bus Routes | Hard | 47.1% | 75.5% | ArrayHash TableBreadth-First Search |
| Longest Palindromic Substring | Medium | 37.4% | 71.8% | Two PointersStringDynamic Programming |
| Trapping Rain Water | Hard | 66.8% | 71.8% | ArrayTwo PointersDynamic Programming+2 |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 67.3% | ArrayBinary SearchSorting+2 |
| Frequency of the Most Frequent Element | Medium | 44.6% | 67.3% | ArrayBinary SearchGreedy+3 |
| House Robber II | Medium | 44.6% | 67.3% | ArrayDynamic Programming |
| Split Array Largest Sum | Hard | 59.9% | 67.3% | ArrayBinary SearchDynamic Programming+2 |
| Candy | Hard | 48.0% | 67.3% | ArrayGreedy |
| House Robber | Medium | 52.9% | 67.3% | ArrayDynamic Programming |
| Queue Reconstruction by Height | Medium | 74.6% | 67.3% | ArrayBinary Indexed TreeSegment Tree+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 67.3% | ArrayBinary SearchDynamic Programming+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 67.3% | ArrayDynamic Programming |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.2% | 61.9% | ArrayUnion FindSorting |
| IPO | Hard | 53.3% | 61.9% | ArrayGreedySorting+1 |
| Koko Eating Bananas | Medium | 49.7% | 61.9% | ArrayBinary Search |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 61.9% | Hash TableTreeDepth-First Search+2 |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% | 61.9% | GraphHeap (Priority Queue)Shortest Path |
| Jump Game II | Medium | 42.5% | 61.9% | ArrayDynamic ProgrammingGreedy |
| Sum of Distances in Tree | Hard | 65.5% | 61.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 61.9% | ArrayQueueSliding Window+3 |
| Split Array into Consecutive Subsequences | Medium | 52.0% | 54.9% | ArrayHash TableGreedy+1 |
| Matchsticks to Square | Medium | 41.6% | 54.9% | ArrayDynamic ProgrammingBacktracking+2 |
| Sliding Window Maximum | Hard | 48.5% | 54.9% | ArrayQueueSliding Window+2 |
| Rotting Oranges | Medium | 58.2% | 54.9% | ArrayBreadth-First SearchMatrix |
| Word Ladder | Hard | 44.9% | 54.9% | Hash TableStringBreadth-First Search |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 54.9% | ArrayDynamic ProgrammingSorting |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 54.9% | ArrayDynamic Programming |
| House Robber III | Medium | 55.6% | 54.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Sort Colors | Medium | 69.2% | 54.9% | ArrayTwo PointersSorting |
| Distribute Coins in Binary Tree | Medium | 77.3% | 54.9% | TreeDepth-First SearchBinary Tree |
| Maximal Square | Medium | 50.0% | 54.9% | ArrayDynamic ProgrammingMatrix |
| Swim in Rising Water | Hard | 67.6% | 54.9% | ArrayBinary SearchDepth-First Search+4 |
| Accounts Merge | Medium | 60.9% | 54.9% | ArrayHash TableString+4 |
| Merge Intervals | Medium | 51.2% | 54.9% | ArraySorting |
| Find Duplicate Subtrees | Medium | 60.6% | 45.1% | Hash TableTreeDepth-First Search+1 |
| Maximum Performance of a Team | Hard | 47.7% | 45.1% | ArrayGreedySorting+1 |
| Ways to Make a Fair Array | Medium | 66.4% | 45.1% | ArrayPrefix Sum |
| Evaluate Division | Medium | 64.0% | 45.1% | ArrayStringDepth-First Search+4 |
| LRU Cache | Medium | 46.8% | 45.1% | Hash TableLinked ListDesign+1 |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 45.1% | ArrayHash TableString+2 |
| Walking Robot Simulation | Medium | 58.4% | 45.1% | ArrayHash TableSimulation |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 45.1% | ArrayDynamic ProgrammingStack+2 |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 45.1% | ArrayHash TableTwo Pointers+4 |
| Complete Binary Tree Inserter | Medium | 65.0% | 45.1% | TreeBreadth-First SearchDesign+1 |
| Apply Operations to Maximize Frequency Score | Hard | 38.6% | 45.1% | ArrayBinary SearchSliding Window+2 |
| Longest Common Prefix | Easy | 47.1% | 45.1% | StringTrie |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 45.1% | ArrayDynamic ProgrammingGreedy |
| Largest Rectangle in Histogram | Hard | 49.4% | 45.1% | ArrayStackMonotonic Stack |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 45.1% | ArrayTwo PointersBinary Search+4 |
| Make Sum Divisible by P | Medium | 42.6% | 45.1% | ArrayHash TablePrefix Sum |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 45.1% | ArrayDynamic ProgrammingBacktracking+2 |
| Decode Ways II | Hard | 31.7% | 45.1% | StringDynamic Programming |
| Number of Islands II | Hard | 40.4% | 45.1% | ArrayHash TableUnion Find |
| Alien Dictionary | Hard | 37.1% | 45.1% | ArrayStringDepth-First Search+3 |
| Daily Temperatures | Medium | 68.4% | 45.1% | ArrayStackMonotonic Stack |
| Longest Repeating Character Replacement | Medium | 59.1% | 45.1% | Hash TableStringSliding Window |
| Course Schedule II | Medium | 55.0% | 45.1% | Depth-First SearchBreadth-First SearchGraph+1 |
| String Compression | Medium | 59.6% | 45.1% | Two PointersString |
| Number of Islands | Medium | 63.8% | 45.1% | ArrayDepth-First SearchBreadth-First Search+2 |
| Copy List with Random Pointer | Medium | 62.4% | 45.1% | Hash TableLinked List |
| Gas Station | Medium | 47.5% | 45.1% | ArrayGreedy |
| Find the Celebrity | Medium | 48.9% | 45.1% | Two PointersGraphInteractive |
| Magnetic Force Between Two Balls | Medium | 71.9% | 45.1% | ArrayBinary SearchSorting |
| Minimum Height Trees | Medium | 42.4% | 45.1% | Depth-First SearchBreadth-First SearchGraph+1 |
| Number of Flowers in Full Bloom | Hard | 57.7% | 45.1% | ArrayHash TableBinary Search+3 |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 45.1% | ArrayDynamic Programming |
| Binary Tree Level Order Traversal | Medium | 72.2% | 45.1% | TreeBreadth-First SearchBinary Tree |
| Group Anagrams | Medium | 72.2% | 45.1% | ArrayHash TableString+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 45.1% | ArrayHash TableUnion Find |
| First Missing Positive | Hard | 42.5% | 45.1% | ArrayHash Table |
| Heaters | Medium | 41.4% | 45.1% | ArrayTwo PointersBinary Search+1 |
| Snakes and Ladders | Medium | 48.0% | 45.1% | ArrayBreadth-First SearchMatrix |
| Sum of Subarray Minimums | Medium | 38.3% | 45.1% | ArrayDynamic ProgrammingStack+1 |
| Asteroid Collision | Medium | 47.2% | 45.1% | ArrayStackSimulation |
| Generate Parentheses | Medium | 78.3% | 45.1% | StringDynamic ProgrammingBacktracking |
| Insert Interval | Medium | 44.8% | 45.1% | Array |
| Binary Tree Cameras | Hard | 47.6% | 45.1% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Jump Game | Medium | 40.5% | 45.1% | ArrayDynamic ProgrammingGreedy |