| Reorganize String | Medium | 56.8% | 78.9% |
| Container With Most Water | Medium | 59.6% | 76.5% |
| Jump Game | Medium | 40.5% | 67.4% |
| Task Scheduler | Medium | 62.7% | 63.3% |
| Meeting Rooms II | Medium | 52.6% | 62.3% |
| Jump Game II | Medium | 42.5% | 60.4% |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 59.3% |
| Candy | Hard | 48.0% | 54.4% |
| Gas Station | Medium | 47.5% | 54.2% |
| Split Array Largest Sum | Hard | 59.9% | 50.7% |
| Largest Number | Medium | 42.6% | 49.9% |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 49.2% |
| Make Array Zero by Subtracting Equal Amounts | Easy | 73.7% | 47.6% |
| Minimum Health to Beat Game | Medium | 58.8% | 45.3% |
| Partition Labels | Medium | 81.8% | 43.9% |
| Boats to Save People | Medium | 61.4% | 42.2% |
| Valid Palindrome II | Easy | 44.0% | 42.2% |
| Non-overlapping Intervals | Medium | 56.7% | 41.6% |
| Remove K Digits | Medium | 36.4% | 41.6% |
| Frequency of the Most Frequent Element | Medium | 44.6% | 41.6% |
| Furthest Building You Can Reach | Medium | 50.7% | 40.4% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 40.4% |
| Can Place Flowers | Easy | 29.1% | 39.8% |
| Maximum Units on a Truck | Easy | 74.7% | 39.8% |
| Assign Cookies | Easy | 54.7% | 39.1% |
| Valid Parenthesis String | Medium | 39.8% | 36.9% |
| Wildcard Matching | Hard | 31.4% | 36.9% |
| Lexicographically Smallest Negated Permutation that Sums to Target | Medium | 30.8% | 36.9% |
| Increasing Triplet Subsequence | Medium | 39.2% | 36.9% |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% | 36.1% |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 34.4% |
| Remove Duplicate Letters | Medium | 52.8% | 34.4% |
| Balance a Binary Search Tree | Medium | 86.3% | 33.5% |
| Put Marbles in Bags | Hard | 72.2% | 33.5% |
| Minimum Number of Pushes to Type Word II | Medium | 80.0% | 33.5% |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% | 33.5% |
| Minimum Operations to Make Array Non Decreasing | Medium | | 32.5% |
| Maximum Number of Groups With Increasing Length | Hard | 23.0% | 32.5% |
| Maximum Average Pass Ratio | Medium | 74.1% | 32.5% |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 32.5% |
| Maximum Coins From K Consecutive Bags | Medium | 24.5% | 31.5% |
| Sell Diminishing-Valued Colored Balls | Medium | 30.1% | 31.5% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 31.5% |
| Maximum Length of Pair Chain | Medium | 61.6% | 30.4% |
| Maximum Sum With at Most K Elements | Medium | 60.6% | 29.3% |
| Lemonade Change | Easy | 58.9% | 29.3% |
| Minimum Swaps to Avoid Forbidden Values | Hard | 30.2% | 29.3% |
| Partition Array Such That Maximum Difference Is K | Medium | 81.8% | 29.3% |
| Minimum Operations to Make the Array Alternating | Medium | 35.4% | 29.3% |
| Minimum Adjacent Swaps to Make a Valid Array | Medium | 72.2% | 29.3% |
| Construct Smallest Number From DI String | Medium | 85.6% | 29.3% |
| Minimum Rounds to Complete All Tasks | Medium | 63.2% | 29.3% |
| Optimal Partition of String | Medium | 78.4% | 28.0% |
| Array Partition | Easy | 81.5% | 28.0% |
| Maximize Happiness of Selected Children | Medium | 58.7% | 28.0% |
| Super Washing Machines | Hard | 43.9% | 28.0% |
| Minimum Sum of Four Digit Number After Splitting Digits | Easy | 86.2% | 28.0% |
| Minimum Sum of Squared Difference | Medium | 26.8% | 28.0% |
| Largest Odd Number in String | Easy | 67.0% | 26.7% |
| Longest Palindrome | Easy | 55.8% | 26.7% |
| Minimum Number of Operations to Make Array Empty | Medium | 62.1% | 26.7% |
| Split With Minimum Sum | Easy | 73.3% | 26.7% |
| Distant Barcodes | Medium | 48.6% | 26.7% |
| Maximum Bags With Full Capacity of Rocks | Medium | 68.0% | 26.7% |
| Maximum Matching of Players With Trainers | Medium | 75.2% | 26.7% |
| Maximum Total from Optimal Activation Order | Medium | 33.0% | 26.7% |
| Maximum Element After Decreasing and Rearranging | Medium | 65.8% | 26.7% |
| Maximize Number of Subsequences in a String | Medium | 35.9% | 26.7% |
| Maximum Bitwise AND After Increment Operations | Hard | 31.0% | 25.3% |
| Minimum Number of Coins to be Added | Medium | 58.0% | 25.3% |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% | 25.3% |
| Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium | 63.2% | 25.3% |
| Maximum Number of Non-Overlapping Substrings | Hard | 41.5% | 25.3% |
| Minimum Number of Keypresses | Medium | 71.4% | 25.3% |
| Find Minimum Time to Finish All Jobs II | Medium | 66.0% | 25.3% |
| Minimum Number of Pushes to Type Word I | Easy | 66.9% | 25.3% |
| Maximum Star Sum of a Graph | Medium | 42.0% | 25.3% |
| Replace Question Marks in String to Minimize Its Value | Medium | 29.0% | 25.3% |
| Form Array by Concatenating Subarrays of Another Array | Medium | 54.7% | 25.3% |
| Monotone Increasing Digits | Medium | 49.4% | 25.3% |
| Append Characters to String to Make Subsequence | Medium | 73.0% | 25.3% |
| Minimized Maximum of Products Distributed to Any Store | Medium | 63.0% | 23.7% |
| IPO | Hard | 53.3% | 23.7% |
| Maximum Matrix Sum | Medium | 67.6% | 23.7% |
| Lexicographically Maximum MEX Array | Hard | | 23.7% |
| Max Chunks To Make Sorted | Medium | 64.1% | 23.7% |
| Maximum Swap | Medium | 51.9% | 23.7% |
| Valid Triangle Number | Medium | 56.7% | 23.7% |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 23.7% |
| Minimum Numbers of Function Calls to Make Target Array | Medium | 62.8% | 23.7% |
| Largest Multiple of Three | Hard | 33.1% | 23.7% |
| Append K Integers With Minimal Sum | Medium | 26.9% | 23.7% |
| Maximize the Beauty of the Garden | Hard | 64.6% | 23.7% |
| Minimum Money Required Before Transactions | Hard | 42.0% | 23.7% |
| Minimum Stability Factor of Array | Hard | 20.3% | 23.7% |
| Maximum Ice Cream Bars | Medium | 74.2% | 22.0% |
| Minimum Number of Groups to Create a Valid Assignment | Medium | 24.8% | 22.0% |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 22.0% |
| Course Schedule III | Hard | 41.4% | 22.0% |
| House Robber IV | Medium | 64.8% | 22.0% |
| Avoid Flood in The City | Medium | 39.0% | 22.0% |
| Maximum Median Sum of Subsequences of Size 3 | Medium | 65.1% | 22.0% |
| Minimize Array Sum Using Divisible Replacements | Medium | | 22.0% |
| Longest Happy String | Medium | 65.5% | 20.2% |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 20.2% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 20.2% |
| Greatest Sum Divisible by Three | Medium | 57.1% | 20.2% |
| Minimum Cost to Connect Sticks | Medium | 71.8% | 20.2% |
| Maximum Calories Burnt from Jumps | Medium | 73.9% | 20.2% |
| Maximize Points After Choosing K Tasks | Medium | 59.9% | 20.2% |
| Maximum Score After Binary Swaps | Medium | 35.0% | 20.2% |
| Maximum Total Value of Covered Indices | Medium | | 20.2% |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% | 18.1% |
| Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | 59.2% | 18.1% |
| Maximum Performance of a Team | Hard | 47.7% | 18.1% |
| Reschedule Meetings for Maximum Free Time I | Medium | 53.9% | 18.1% |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 18.1% |
| Separate Black and White Balls | Medium | 64.0% | 18.1% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 18.1% |
| Lexicographically Smallest Permutation Greater Than Target | Medium | 26.5% | 18.1% |
| Earliest Finish Time for Land and Water Rides II | Medium | | 15.8% |
| Earliest Finish Time for Land and Water Rides I | Easy | | 15.8% |
| Minimum Cost of Buying Candies With Discount | Easy | 62.7% | 15.8% |
| Minimum Initial Energy to Finish Tasks | Hard | 60.7% | 15.8% |
| Rabbits in Forest | Medium | 58.1% | 15.8% |
| Minimum Domino Rotations For Equal Row | Medium | 56.5% | 15.8% |
| Maximum Tastiness of Candy Basket | Medium | 67.9% | 15.8% |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 15.8% |
| Set Intersection Size At Least Two | Hard | 57.9% | 15.8% |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 15.8% |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 15.8% |
| Hand of Straights | Medium | 57.8% | 15.8% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 15.8% |
| Minimum Cost to Hire K Workers | Hard | 63.6% | 15.8% |
| Maximum Balanced Shipments | Medium | 61.3% | 15.8% |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | 88.8% | 13.3% |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 13.3% |
| Wiggle Sort II | Medium | 37.0% | 13.3% |
| Dota2 Senate | Medium | 49.6% | 13.3% |
| Maximum Length of Subarray With Positive Product | Medium | 44.6% | 13.3% |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 13.3% |
| Split a String in Balanced Strings | Easy | 87.3% | 13.3% |
| Rearrange String k Distance Apart | Hard | 39.9% | 13.3% |
| Max Difference You Can Get From Changing an Integer | Medium | 48.8% | 13.3% |
| Minimize XOR | Medium | 62.4% | 13.3% |
| Create Maximum Number | Hard | 34.7% | 13.3% |
| Strong Password Checker | Hard | 15.5% | 13.3% |
| Minimum Subsequence in Non-Increasing Order | Easy | 73.6% | 13.3% |
| Smallest Missing Non-negative Integer After Operations | Medium | 55.9% | 13.3% |
| Largest Palindromic Number | Medium | 37.0% | 10.4% |
| Rearranging Fruits | Hard | 57.5% | 10.4% |
| Two Furthest Houses With Different Colors | Easy | 65.5% | 10.4% |
| Maximum Total Subarray Value I | Medium | | 10.4% |
| Smallest Range II | Medium | 37.7% | 10.4% |
| Largest Perimeter Triangle | Easy | 62.0% | 10.4% |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 10.4% |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 10.4% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 10.4% |
| Lexicographically Smallest Beautiful String | Hard | 38.1% | 10.4% |
| Rearrange Array to Maximize Prefix Score | Medium | 42.5% | 10.4% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 10.4% |
| Minimum Deletions to Make Character Frequencies Unique | Medium | 61.4% | 10.4% |
| Minimum Operations to Convert All Elements to Zero | Medium | 53.0% | 10.4% |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 10.4% |
| Maximum Running Time of N Computers | Hard | 56.4% | 10.4% |
| Maximum Number of Distinct Elements After Operations | Medium | 52.2% | 10.4% |
| Most Profit Assigning Work | Medium | 56.1% | 10.4% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 10.4% |
| DI String Match | Easy | 80.9% | 10.4% |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 10.4% |
| Partition Array Into Three Parts With Equal Sum | Easy | 42.6% | 10.4% |
| Minimum Number of People to Teach | Medium | 67.7% | 10.4% |
| Maximize the Minimum Powered City | Hard | 61.8% | 10.4% |
| Delete Columns to Make Sorted II | Medium | 49.7% | 10.4% |
| Score After Flipping Matrix | Medium | 80.3% | 7.2% |
| Largest Submatrix With Rearrangements | Medium | 75.2% | 7.2% |
| Minimum Number of Seconds to Make Mountain Height Zero | Medium | 36.9% | 7.2% |
| Two City Scheduling | Medium | 68.4% | 7.2% |
| Maximum 69 Number | Easy | 84.5% | 7.2% |
| Minimize Maximum of Array | Medium | 46.5% | 7.2% |
| Minimum Number of Moves to Seat Everyone | Easy | 87.2% | 7.2% |
| Maximize Score of Numbers in Ranges | Medium | 35.6% | 7.2% |
| Construct K Palindrome Strings | Medium | 68.6% | 7.2% |
| Maximal Score After Applying K Operations | Medium | 64.0% | 7.2% |
| Minimum Operations to Make a Subsequence | Hard | 49.6% | 7.2% |
| Longest Binary Subsequence Less Than or Equal to K | Medium | 52.8% | 7.2% |
| Minimum Time to Make Rope Colorful | Medium | 65.2% | 7.2% |
| Reschedule Meetings for Maximum Free Time II | Medium | 60.4% | 7.2% |
| Maximum Score From Removing Substrings | Medium | 66.6% | 7.2% |
| Maximum Number of Operations to Move Ones to the End | Medium | 67.1% | 7.2% |
| Bag of Tokens | Medium | 59.5% | 7.2% |
| Patching Array | Hard | 54.1% | 7.2% |
| Minimum Operations to Make the Array Increasing | Easy | 81.9% | 7.2% |
| Minimize Maximum Pair Sum in Array | Medium | 83.3% | 7.2% |
| Longest Subsequence With Limited Sum | Easy | 73.4% | 7.2% |
| Minimum Swaps to Arrange a Binary Grid | Medium | | 7.2% |
| Maximize Spanning Tree Stability with Upgrades | Hard | | 7.2% |
| Find Maximum Value in a Constrained Sequence | Medium | 62.2% | 5.0% |
| Minimum Cost to Make Array Equal | Hard | 46.7% | 5.0% |
| Advantage Shuffle | Medium | 54.3% | 5.0% |
| Maximum Number of Coins You Can Get | Medium | 84.7% | 5.0% |
| Maximum Subsequence Score | Medium | 54.6% | 5.0% |
| Maximum Odd Binary Number | Easy | 82.9% | 5.0% |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 5.0% |
| Remove Digit From Number to Maximize Result | Easy | 48.2% | 5.0% |
| Minimum Cost to Equalize Array | Hard | 18.7% | 5.0% |
| Maximum Distance in Arrays | Medium | 45.6% | 5.0% |
| Minimum Insertions to Balance a Parentheses String | Medium | 53.5% | 5.0% |
| Lexicographically Smallest String After Substring Operation | Medium | 34.5% | 5.0% |
| Minimum Division Operations to Make Array Non Decreasing | Medium | 29.1% | 5.0% |
| Prime Subtraction Operation | Medium | 55.6% | 5.0% |
| Largest Element in an Array after Merge Operations | Medium | 47.6% | 5.0% |
| Minimum Operations to Make Array Equal to Target | Hard | 41.3% | 5.0% |
| Maximum Sum With Exactly K Elements | Easy | 80.5% | 5.0% |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 5.0% |
| Maximize the Minimum Game Score | Hard | 26.0% | 5.0% |
| Select K Disjoint Special Substrings | Medium | 19.1% | 5.0% |
| Maximize Greatness of an Array | Medium | 61.3% | 5.0% |
| String Without AAA or BBB | Medium | 45.0% | 5.0% |
| Minimum Cost to Make Arrays Identical | Medium | 37.7% | 5.0% |
| Minimum Number of Swaps to Make the Binary String Alternating | Medium | 43.9% | 5.0% |
| Minimum Amount of Damage Dealt to Bob | Hard | 39.6% | 5.0% |
| Integer Replacement | Medium | 37.2% | 5.0% |
| Pizza With 3n Slices | Hard | 53.8% | 5.0% |
| Zero Array Transformation III | Medium | 54.9% | 5.0% |
| Minimum Cost to Move Chips to The Same Position | Easy | 72.8% | 5.0% |
| Minimum Moves to Reach Target Score | Medium | 52.3% | 5.0% |
| Minimize the Maximum Adjacent Element Difference | Hard | 19.4% | 5.0% |
| Find the Largest Palindrome Divisible by K | Hard | 16.9% | 5.0% |
| Maximum Difference by Remapping a Digit | Easy | 76.1% | 5.0% |
| Remove Stones to Minimize the Total | Medium | 65.5% | 5.0% |
| Buy Two Chocolates | Easy | 68.3% | 5.0% |
| Maximum Value after Insertion | Medium | 39.2% | 5.0% |
| Maximum Size of a Set After Removals | Medium | 46.1% | 5.0% |
| Minimum Suffix Flips | Medium | 73.9% | 5.0% |
| Wiggle Sort | Medium | 68.4% | 5.0% |
| Minimum Non-Zero Product of the Array Elements | Medium | 37.4% | 5.0% |
| Find Original Array From Doubled Array | Medium | 40.7% | 5.0% |
| Maximum Sum of Three Numbers Divisible by Three | Medium | 47.7% | 5.0% |
| Frog Jump II | Medium | 62.4% | 5.0% |
| Minimum Addition to Make Integer Beautiful | Medium | 38.6% | 5.0% |
| Minimum Hours of Training to Win a Competition | Easy | 42.4% | 5.0% |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 5.0% |
| Word Abbreviation | Hard | 62.7% | 5.0% |
| Maximum Number of Weeks for Which You Can Work | Medium | 42.3% | 5.0% |
| Lexicographically Smallest Generated String | Hard | 31.5% | 5.0% |
| Put Boxes Into the Warehouse I | Medium | 67.4% | 5.0% |
| Pancake Sorting | Medium | 71.7% | 5.0% |
| Maximum Total Subarray Value II | Hard | | 5.0% |
| Maximize Sum Of Array After K Negations | Easy | 53.6% | 5.0% |
