| Best Time to Buy and Sell Stock | Easy | 56.4% | 84.0% |
| Trapping Rain Water | Hard | 66.8% | 80.6% |
| Longest Palindromic Substring | Medium | 37.4% | 80.1% |
| Maximum Subarray | Medium | 53.0% | 70.6% |
| Generate Parentheses | Medium | 78.3% | 66.3% |
| Climbing Stairs | Easy | 53.9% | 65.6% |
| Word Break II | Hard | 55.1% | 63.7% |
| Coin Change | Medium | 48.0% | 62.9% |
| Pascal's Triangle | Easy | 78.7% | 62.5% |
| Sort Integers by The Power Value | Medium | 71.6% | 62.0% |
| Jump Game | Medium | 40.5% | 62.0% |
| House Robber | Medium | 52.9% | 59.3% |
| Word Break | Medium | 49.1% | 59.3% |
| Palindrome Partitioning | Medium | 73.7% | 59.3% |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 55.4% |
| Unique Paths | Medium | 66.6% | 54.8% |
| Maximum Product Subarray | Medium | 36.0% | 52.1% |
| Longest Increasing Subsequence | Medium | 59.1% | 52.1% |
| Regular Expression Matching | Hard | 30.5% | 50.5% |
| Jump Game II | Medium | 42.5% | 49.7% |
| Unique Paths II | Medium | 44.2% | 49.7% |
| Edit Distance | Medium | 60.2% | 49.7% |
| Fibonacci Number | Easy | 73.9% | 49.7% |
| Wildcard Matching | Hard | 31.4% | 48.0% |
| Partition Equal Subset Sum | Medium | 49.2% | 47.1% |
| Split Array Largest Sum | Hard | 59.9% | 46.1% |
| Triangle | Medium | 59.9% | 45.1% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 44.0% |
| Longest Valid Parentheses | Hard | 38.1% | 42.9% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 40.4% |
| Maximal Rectangle | Hard | 58.1% | 40.4% |
| House Robber II | Medium | 44.6% | 40.4% |
| Perfect Squares | Medium | 56.3% | 39.0% |
| Non-overlapping Intervals | Medium | 56.7% | 39.0% |
| Sum of Subarray Minimums | Medium | 38.3% | 39.0% |
| Number of Digit One | Hard | 37.7% | 39.0% |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 39.0% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 35.9% |
| Target Sum | Medium | 51.9% | 35.9% |
| Is Subsequence | Easy | 48.9% | 35.9% |
| Valid Parenthesis String | Medium | 39.8% | 34.1% |
| Longest Common Subsequence | Medium | 58.9% | 34.1% |
| Interleaving String | Medium | 43.5% | 34.1% |
| Allocate Mailboxes | Hard | 56.5% | 34.1% |
| Minimum Path Sum | Medium | 67.8% | 32.2% |
| Different Ways to Add Parentheses | Medium | 73.1% | 32.2% |
| Largest Divisible Subset | Medium | 49.4% | 30.0% |
| Palindromic Substrings | Medium | 72.6% | 30.0% |
| 01 Matrix | Medium | 53.4% | 27.6% |
| Distinct Subsequences | Hard | 51.5% | 24.9% |
| Ugly Number II | Medium | 49.5% | 24.9% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 24.9% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 24.9% |
| Decode Ways | Medium | 37.6% | 24.9% |
| House Robber IV | Medium | 64.8% | 24.9% |
| Best Sightseeing Pair | Medium | 62.7% | 24.9% |
| Coin Change II | Medium | 60.4% | 24.9% |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 21.7% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 21.7% |
| Min Cost Climbing Stairs | Easy | 68.0% | 21.7% |
| Push Dominoes | Medium | 63.0% | 21.7% |
| Longest Binary Subsequence Less Than or Equal to K | Medium | 52.8% | 21.7% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 21.7% |
| Bitwise ORs of Subarrays | Medium | 56.8% | 21.7% |
| Number of Matching Subsequences | Medium | 50.6% | 21.7% |
| Longest Palindromic Subsequence | Medium | 65.1% | 21.7% |
| Count Submatrices With All Ones | Medium | 71.1% | 21.7% |
| Ways to Express an Integer as Sum of Powers | Medium | 49.9% | 21.7% |
| Counting Bits | Easy | 80.4% | 21.7% |
| Minimum Cost For Tickets | Medium | 67.4% | 21.7% |
| Total Waviness of Numbers in Range II | Hard | | 18.0% |
| Jump Game VII | Medium | 26.4% | 18.0% |
| Number of Longest Increasing Subsequence | Medium | 51.4% | 18.0% |
| Rotate Function | Medium | 45.4% | 18.0% |
| Pascal's Triangle II | Easy | 67.1% | 18.0% |
| Integer Break | Medium | 61.9% | 18.0% |
| N-th Tribonacci Number | Easy | 63.3% | 18.0% |
| Strange Printer | Hard | 60.9% | 18.0% |
| Maximum Length of Repeated Subarray | Medium | 51.3% | 18.0% |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 18.0% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 18.0% |
| Ones and Zeroes | Medium | 53.1% | 18.0% |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 18.0% |
| Binary Tree Cameras | Hard | 47.6% | 18.0% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 18.0% |
| New 21 Game | Medium | 52.0% | 18.0% |
| Number of People Aware of a Secret | Medium | 60.9% | 18.0% |
| Taking Maximum Energy From the Mystic Dungeon | Medium | 61.0% | 18.0% |
| Burst Balloons | Hard | 63.0% | 18.0% |
| Delete and Earn | Medium | 57.1% | 18.0% |
| Partition Array for Maximum Sum | Medium | 77.3% | 18.0% |
| Longest String Chain | Medium | 62.8% | 18.0% |
| Minimum Deletions to Make String Balanced | Medium | 68.2% | 18.0% |
| Minimum Total Distance Traveled | Hard | 58.8% | 18.0% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 18.0% |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 18.0% |
| Number of Ways to Assign Edge Weights II | Hard | | 13.6% |
| Guess Number Higher or Lower II | Medium | 52.5% | 13.6% |
| Number of ZigZag Arrays II | Hard | | 13.6% |
| Champagne Tower | Medium | 64.1% | 13.6% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 13.6% |
| Predict the Winner | Medium | 56.1% | 13.6% |
| 2 Keys Keyboard | Medium | 59.3% | 13.6% |
| Knight Dialer | Medium | 61.7% | 13.6% |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 13.6% |
| Divisor Game | Easy | 71.6% | 13.6% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 13.6% |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 13.6% |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 13.6% |
| Count Beautiful Splits in an Array | Medium | 18.6% | 13.6% |
| Find the Maximum Number of Fruits Collected | Hard | 65.1% | 13.6% |
| Dungeon Game | Hard | 40.9% | 13.6% |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.1% | 13.6% |
| Maximum Sum Circular Subarray | Medium | 49.5% | 13.6% |
| Unique Binary Search Trees II | Medium | 62.0% | 13.6% |
| Domino and Tromino Tiling | Medium | 51.4% | 13.6% |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 13.6% |
| Minimum Falling Path Sum | Medium | 60.8% | 13.6% |
| Maximum Absolute Sum of Any Subarray | Medium | 71.2% | 13.6% |
| Maximum Repeating Substring | Easy | 41.1% | 13.6% |
| Super Egg Drop | Hard | 29.9% | 13.6% |
| Maximum Amount of Money Robot Can Earn | Medium | 29.5% | 13.6% |
| Combination Sum IV | Medium | 55.0% | 13.6% |
| House Robber III | Medium | 55.6% | 13.6% |
| Unique Binary Search Trees | Medium | 63.3% | 8.4% |
| Palindrome Partitioning II | Hard | 36.6% | 8.4% |
| Out of Boundary Paths | Medium | 48.4% | 8.4% |
| Stone Game II | Medium | 72.9% | 8.4% |
| Maximum Alternating Subsequence Sum | Medium | 59.0% | 8.4% |
| Filling Bookcase Shelves | Medium | 68.6% | 8.4% |
| Stone Game | Medium | 72.8% | 8.4% |
| Count Numbers with Unique Digits | Medium | 55.4% | 8.4% |
| Maximum Number of Points with Cost | Medium | 41.8% | 8.4% |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 8.4% |
| Last Stone Weight II | Medium | 59.3% | 8.4% |
| Maximum and Minimum Sums of at Most Size K Subsequences | Medium | 21.6% | 8.4% |
| Paint House IV | Medium | 45.1% | 8.4% |
| Minimum Time to Make Rope Colorful | Medium | 65.2% | 8.4% |
| Solving Questions With Brainpower | Medium | 60.2% | 8.4% |
| Find Maximum Number of Non Intersecting Substrings | Medium | 30.4% | 8.4% |
| Beautiful Arrangement | Medium | 64.7% | 8.4% |
| Scramble String | Hard | 43.9% | 8.4% |
| Longest Arithmetic Subsequence | Medium | 49.9% | 8.4% |
| Student Attendance Record II | Hard | 56.4% | 8.4% |
| The Number of Beautiful Subsets | Medium | 50.9% | 8.4% |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 8.4% |
| Find the Original Typed String II | Hard | 45.6% | 8.4% |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 8.4% |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 8.4% |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 8.4% |
| Maximal Square | Medium | 50.0% | 8.4% |
| Frog Jump | Hard | 47.1% | 8.4% |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 8.4% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 8.4% |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 8.4% |
| Russian Doll Envelopes | Hard | 37.7% | 8.4% |
| Greatest Sum Divisible by Three | Medium | 57.1% | 8.4% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 8.4% |
| Number of Ways to Divide a Long Corridor | Hard | 54.6% | 8.4% |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 8.4% |
| Number of ZigZag Arrays I | Hard | | 8.4% |
| Count the Number of Inversions | Hard | 29.7% | 8.4% |
| Minimum Falling Path Sum II | Hard | 63.2% | 8.4% |
| Find Minimum Cost to Remove Array Elements | Medium | 21.3% | 8.4% |
| Soup Servings | Medium | 59.7% | 8.4% |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 8.4% |
| Trionic Array II | Hard | 47.3% | 8.4% |
| Max Consecutive Ones II | Medium | 51.9% | 8.4% |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 8.4% |
| Shortest Common Supersequence | Hard | 61.8% | 8.4% |
| Jump Game IX | Medium | 23.8% | 8.4% |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 8.4% |
| Count Square Submatrices with All Ones | Medium | 80.7% | 8.4% |
