| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 100.0% |
| Remove Adjacent Almost-Equal Characters | Medium | 53.1% | 71.3% |
| Maximum Palindromes After Operations | Medium | 45.6% | 67.4% |
| Split a String in Balanced Strings | Easy | 87.3% | 60.5% |
| Maximum Number That Makes Result of Bitwise AND Zero | Medium | 70.1% | 60.5% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 53.2% |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 46.4% |
| Maximum Units on a Truck | Easy | 74.7% | 46.4% |
| Container With Most Water | Medium | 59.6% | 41.9% |
| Meeting Rooms II | Medium | 52.6% | 41.9% |
| Gas Station | Medium | 47.5% | 41.9% |
| Valid Parenthesis String | Medium | 39.8% | 36.1% |
| Reorganize String | Medium | 56.8% | 36.1% |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 28.2% |
| Remove Stones to Minimize the Total | Medium | 65.5% | 28.2% |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 28.2% |
| Candy | Hard | 48.0% | 28.2% |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 28.2% |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 28.2% |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 28.2% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 28.2% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 28.2% |
| Course Schedule III | Hard | 41.4% | 28.2% |
