| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 100.0% |
| Time Needed to Rearrange a Binary String | Medium | 52.6% | 80.8% |
| Remove Adjacent Almost-Equal Characters | Medium | 53.1% | 71.3% |
| Distinct Subsequences | Hard | 51.5% | 64.2% |
| Count the Number of Inversions | Hard | 29.7% | 60.5% |
| Maximize Grid Happiness | Hard | 40.9% | 60.5% |
| Equalize Strings by Adding or Removing Characters at Ends | Medium | 56.6% | 60.5% |
| Number of Self-Divisible Permutations | Medium | 71.7% | 60.5% |
| Palindromic Substrings | Medium | 72.6% | 58.3% |
| Delete and Earn | Medium | 57.1% | 58.3% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 55.9% |
| Longest Common Subsequence | Medium | 58.9% | 55.9% |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 53.2% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 53.2% |
| Longest Palindromic Substring | Medium | 37.4% | 50.1% |
| Trapping Rain Water | Hard | 66.8% | 50.1% |
| Count Palindromic Subsequences | Hard | 41.0% | 50.1% |
| Number of Digit One | Hard | 37.7% | 50.1% |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 41.9% |
| Coin Change | Medium | 48.0% | 41.9% |
| Maximum Subarray | Medium | 53.0% | 41.9% |
| Strange Printer | Hard | 60.9% | 36.1% |
| Generate Parentheses | Medium | 78.3% | 36.1% |
| Valid Parenthesis String | Medium | 39.8% | 36.1% |
| Word Break | Medium | 49.1% | 36.1% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 36.1% |
| Optimal Account Balancing | Hard | 50.3% | 36.1% |
| All Possible Full Binary Trees | Medium | 82.7% | 36.1% |
| Maximal Square | Medium | 50.0% | 36.1% |
| Longest Increasing Subsequence | Medium | 59.1% | 36.1% |
| Maximal Rectangle | Hard | 58.1% | 36.1% |
| House Robber III | Medium | 55.6% | 36.1% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 28.2% |
| Maximum Product Subarray | Medium | 36.0% | 28.2% |
| Maximum Earnings From Taxi | Medium | 46.2% | 28.2% |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 28.2% |
| Minimum Window Subsequence | Hard | 43.8% | 28.2% |
| House Robber II | Medium | 44.6% | 28.2% |
| Partition Equal Subset Sum | Medium | 49.2% | 28.2% |
| Minimum Array Sum | Medium | 31.0% | 28.2% |
| Burst Balloons | Hard | 63.0% | 28.2% |
| Coin Change II | Medium | 60.4% | 28.2% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 28.2% |
