| Separate Black and White Balls | Medium | 64.0% |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% |
| Container With Most Water | Medium | 59.5% |
| Candy | Hard | 47.9% |
| Largest Number | Medium | 42.6% |
| Assign Cookies | Easy | 54.7% |
| Smallest Divisible Digit Product II | Hard | 14.4% |
| Longest Palindrome | Easy | 55.8% |
| Largest Odd Number in String | Easy | 66.9% |
| Best Time to Buy and Sell Stock II | Medium | 70.7% |
| Remove K Digits | Medium | 36.4% |
| Gas Station | Medium | 47.5% |
| Create Maximum Number | Hard | 34.6% |
| Jump Game II | Medium | 42.4% |
| Jump Game | Medium | 40.5% |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% |
| Reorganize String | Medium | 56.8% |
| Smallest Range II | Medium | 37.7% |
| Bag of Tokens | Medium | 59.5% |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% |
| Minimize XOR | Medium | 62.4% |
| Minimum Processing Time | Medium | 70.2% |
| Task Scheduler | Medium | 62.6% |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% |
| Split Array Largest Sum | Hard | 59.8% |
| Lexicographically Smallest String After Substring Operation | Medium | 34.5% |
| Eliminate Maximum Number of Monsters | Medium | 51.0% |
| Can Place Flowers | Easy | 29.0% |
| Find Polygon With the Largest Perimeter | Medium | 65.5% |
| Minimum Initial Energy to Finish Tasks | Hard | 60.6% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% |
| Reduce Array Size to The Half | Medium | 69.3% |
| Maximum Star Sum of a Graph | Medium | 41.9% |
| Valid Parenthesis String | Medium | 39.8% |
| Wildcard Matching | Hard | 31.3% |
| Remove Duplicate Letters | Medium | 52.8% |
| Wiggle Sort II | Medium | 36.9% |
| Patching Array | Hard | 54.1% |
| Increasing Triplet Subsequence | Medium | 39.2% |
| Strong Password Checker | Hard | 15.4% |
| Non-overlapping Intervals | Medium | 56.7% |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% |
| IPO | Hard | 53.3% |
| Super Washing Machines | Hard | 43.8% |
| Array Partition | Easy | 81.5% |
| Valid Triangle Number | Medium | 56.7% |
| Course Schedule III | Hard | 41.4% |
| Smallest Range Covering Elements from K Lists | Hard | 70.0% |
| Maximum Length of Pair Chain | Medium | 61.5% |
| Dota2 Senate | Medium | 49.6% |
| Split Array into Consecutive Subsequences | Medium | 52.0% |
| Maximum Swap | Medium | 51.9% |
| Valid Palindrome II | Easy | 44.0% |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% |
| Monotone Increasing Digits | Medium | 49.4% |
| Partition Labels | Medium | 81.8% |
| Rabbits in Forest | Medium | 58.0% |
| Most Profit Assigning Work | Medium | 56.1% |
| Hand of Straights | Medium | 57.8% |
| Minimum Cost to Hire K Workers | Hard | 63.6% |
| Lemonade Change | Easy | 58.9% |
| Score After Flipping Matrix | Medium | 80.3% |
| Advantage Shuffle | Medium | 54.2% |
| Minimum Number of Refueling Stops | Hard | 41.1% |
| Boats to Save People | Medium | 61.4% |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% |
| Minimum Increment to Make Array Unique | Medium | 60.6% |
| Largest Perimeter Triangle | Easy | 62.0% |
| Two City Scheduling | Medium | 68.3% |
| Distant Barcodes | Medium | 48.6% |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% |
| Largest Multiple of Three | Hard | 33.1% |
| Balance a Binary Search Tree | Medium | 86.3% |
| Minimum Moves to Reach Target Score | Medium | 52.0% |
| Longest Happy String | Medium | 65.5% |
| Group the People Given the Group Size They Belong To | Medium | 87.5% |
| Maximum 69 Number | Easy | 84.5% |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% |
| Reducing Dishes | Hard | 76.6% |
| Least Number of Unique Integers after K Removals | Medium | 63.7% |
| Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | 59.2% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% |
| Maximum Number of Non-Overlapping Substrings | Hard | 41.4% |
| Minimum Suffix Flips | Medium | 73.9% |
| Minimum Numbers of Function Calls to Make Target Array | Medium | 62.8% |
| Maximum Number of Coins You Can Get | Medium | 84.8% |
| Maximum Length of Subarray With Positive Product | Medium | 44.6% |
| Furthest Building You Can Reach | Medium | 50.7% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% |
| Minimum Deletions to Make Character Frequencies Unique | Medium | 61.4% |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | 88.8% |
| Maximum Score From Removing Substrings | Medium | 66.6% |
| Maximum Units on a Truck | Easy | 74.6% |
| Form Array by Concatenating Subarrays of Another Array | Medium | 54.7% |
| Maximum Average Pass Ratio | Medium | 74.1% |
| Maximum Element After Decreasing and Rearranging | Medium | 65.8% |
| Maximum Ice Cream Bars | Medium | 74.2% |
| Frequency of the Most Frequent Element | Medium | 44.6% |
| Minimum Non-Zero Product of the Array Elements | Medium | 37.4% |
| Minimum Number of Moves to Seat Everyone | Easy | 87.2% |