| Trapping Rain Water | Hard | 66.8% | 73.9% |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 71.8% |
| Longest Palindromic Substring | Medium | 37.4% | 70.1% |
| Maximum Subarray | Medium | 53.0% | 65.3% |
| Climbing Stairs | Easy | 53.9% | 64.4% |
| Generate Parentheses | Medium | 78.3% | 61.0% |
| Pascal's Triangle | Easy | 78.7% | 57.8% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 57.8% |
| Jump Game | Medium | 40.5% | 57.0% |
| Split Array Largest Sum | Hard | 59.9% | 56.9% |
| House Robber | Medium | 52.9% | 55.9% |
| Russian Doll Envelopes | Hard | 37.7% | 53.4% |
| Longest Increasing Subsequence | Medium | 59.1% | 52.9% |
| Regular Expression Matching | Hard | 30.5% | 52.8% |
| Maximal Square | Medium | 50.0% | 51.8% |
| Maximal Rectangle | Hard | 58.1% | 51.1% |
| Unique Paths | Medium | 66.6% | 50.3% |
| Maximum Product Subarray | Medium | 36.0% | 49.6% |
| Coin Change | Medium | 48.0% | 49.4% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 48.8% |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 47.3% |
| Jump Game II | Medium | 42.5% | 47.1% |
| Partition Equal Subset Sum | Medium | 49.2% | 46.6% |
| Fibonacci Number | Easy | 73.9% | 46.0% |
| Edit Distance | Medium | 60.2% | 46.0% |
| Sum of Subarray Minimums | Medium | 38.3% | 45.5% |
| Word Break | Medium | 49.1% | 45.2% |
| Palindrome Partitioning | Medium | 73.7% | 44.9% |
| Wildcard Matching | Hard | 31.4% | 44.3% |
| Target Sum | Medium | 51.9% | 43.0% |
| Burst Balloons | Hard | 63.0% | 41.3% |
| Is Subsequence | Easy | 48.9% | 40.5% |
| Largest Divisible Subset | Medium | 49.4% | 40.2% |
| Longest Valid Parentheses | Hard | 38.1% | 39.8% |
| Perfect Squares | Medium | 56.3% | 39.8% |
| Longest Common Subsequence | Medium | 58.9% | 39.3% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 38.5% |
| 01 Matrix | Medium | 53.4% | 38.5% |
| Coin Change II | Medium | 60.4% | 38.0% |
| Count Square Submatrices with All Ones | Medium | 80.7% | 37.6% |
| House Robber II | Medium | 44.6% | 37.1% |
| Race Car | Hard | 44.6% | 37.1% |
| Odd Even Jump | Hard | 41.1% | 37.1% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 36.6% |
| Number of Matching Subsequences | Medium | 50.6% | 36.6% |
| Minimum Path Sum | Medium | 67.8% | 36.1% |
| Minimum Time to Finish the Race | Hard | 43.3% | 35.6% |
| Min Cost Climbing Stairs | Easy | 68.0% | 35.1% |
| Triangle | Medium | 59.9% | 35.1% |
| Domino and Tromino Tiling | Medium | 51.4% | 35.1% |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 34.5% |
| Combination Sum IV | Medium | 55.0% | 34.5% |
| Soup Servings | Medium | 59.7% | 33.9% |
| Sum of Distances in Tree | Hard | 65.5% | 32.7% |
| Champagne Tower | Medium | 64.1% | 32.7% |
| Android Unlock Patterns | Medium | 53.7% | 32.7% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 32.0% |
| Shortest Path Visiting All Nodes | Hard | 65.8% | 32.0% |
| Palindromic Substrings | Medium | 72.6% | 32.0% |
| Unique Paths II | Medium | 44.2% | 31.4% |
| Word Break II | Hard | 55.1% | 31.4% |
| Count Numbers with Unique Digits | Medium | 55.4% | 31.4% |
| Predict the Winner | Medium | 56.1% | 31.4% |
| Minimum Falling Path Sum | Medium | 60.8% | 30.7% |
| Inverse Coin Change | Medium | 51.5% | 30.7% |
| House Robber III | Medium | 55.6% | 30.7% |
| Decode Ways | Medium | 37.6% | 30.7% |
| New 21 Game | Medium | 52.0% | 30.7% |
| Longest Arithmetic Subsequence of Given Difference | Medium | 54.3% | 30.7% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 30.7% |
| Valid Parenthesis String | Medium | 39.8% | 29.9% |
| Number of Digit One | Hard | 37.7% | 29.9% |
| Non-overlapping Intervals | Medium | 56.7% | 29.9% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 29.9% |
| Rotated Digits | Medium | 56.8% | 29.1% |
| Student Attendance Record II | Hard | 56.4% | 29.1% |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 29.1% |
| Longest Palindromic Subsequence | Medium | 65.1% | 28.3% |
| Longest Arithmetic Subsequence | Medium | 49.9% | 28.3% |
| Sum of Good Subsequences | Hard | 30.8% | 28.3% |
| Maximum Number of Points with Cost | Medium | 41.8% | 28.3% |
| Count Submatrices With All Ones | Medium | 71.1% | 28.3% |
| Optimal Account Balancing | Hard | 50.3% | 28.3% |
| Longest Non-Decreasing Subarray After Replacing at Most One Element | Medium | 21.5% | 27.5% |
| Interleaving String | Medium | 43.5% | 27.5% |
| Pascal's Triangle II | Easy | 67.1% | 27.5% |
| Minimum Number of Flips to Make the Binary String Alternating | Medium | 41.1% | 27.5% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 27.5% |
| Shortest Common Supersequence | Hard | 61.8% | 27.5% |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.1% | 27.5% |
| Filling Bookcase Shelves | Medium | 68.6% | 27.5% |
| Parallel Courses II | Hard | 30.6% | 27.5% |
| Number of Ways to Build Sturdy Brick Wall | Medium | 49.5% | 27.5% |
| Ones and Zeroes | Medium | 53.1% | 27.5% |
| Longest Mountain in Array | Medium | 41.9% | 27.5% |
| Stone Game III | Hard | 63.3% | 27.5% |
| Delete Operation for Two Strings | Medium | 65.3% | 27.5% |
| Maximum Sum Circular Subarray | Medium | 49.5% | 26.5% |
| Minimum Deletions to Make String Balanced | Medium | 68.2% | 26.5% |
| Distinct Subsequences | Hard | 51.5% | 26.5% |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 26.5% |
| Find the Maximum Length of Valid Subsequence I | Medium | 54.9% | 26.5% |
| Minimum Cost to Merge Stones | Hard | 45.6% | 26.5% |
| Longest Increasing Subsequence II | Hard | 26.0% | 26.5% |
| Kth Ancestor of a Tree Node | Hard | 37.2% | 26.5% |
| Cat and Mouse | Hard | 34.8% | 25.6% |
| Number of Unique Good Subsequences | Hard | 52.6% | 25.6% |
| Push Dominoes | Medium | 63.0% | 25.6% |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 25.6% |
| Flip String to Monotone Increasing | Medium | 61.9% | 25.6% |
| Knight Dialer | Medium | 61.7% | 25.6% |
| Sort Integers by The Power Value | Medium | 71.6% | 25.6% |
| Minimum Distance to Type a Word Using Two Fingers | Hard | 59.4% | 24.5% |
| Unique Binary Search Trees II | Medium | 62.0% | 24.5% |
| Longest String Chain | Medium | 62.8% | 24.5% |
| Find the Maximum Sequence Value of Array | Hard | 21.2% | 24.5% |
| Dungeon Game | Hard | 40.9% | 24.5% |
| Counting Bits | Easy | 80.4% | 24.5% |
| Number of Good Ways to Split a String | Medium | 68.4% | 24.5% |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 24.5% |
| Integer Replacement | Medium | 37.2% | 24.5% |
| Cherry Pickup II | Hard | 72.3% | 24.5% |
| Number of Ways of Cutting a Pizza | Hard | 61.6% | 24.5% |
| Jump Game VII | Medium | 26.4% | 24.5% |
| N-th Tribonacci Number | Easy | 63.3% | 23.4% |
| Minimum Cost For Tickets | Medium | 67.4% | 23.4% |
| Frog Jump | Hard | 47.1% | 23.4% |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 23.4% |
| Cat and Mouse II | Hard | 40.4% | 23.4% |
| House Robber IV | Medium | 64.8% | 23.4% |
| Two Best Non-Overlapping Events | Medium | 64.0% | 23.4% |
| Parallel Courses III | Hard | 66.8% | 23.4% |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 23.4% |
| All Possible Full Binary Trees | Medium | 82.7% | 23.4% |
| Disconnect Path in a Binary Matrix by at Most One Flip | Medium | 27.8% | 23.4% |
| Check if There is a Path With Equal Number of 0's And 1's | Medium | 51.9% | 23.4% |
| Video Stitching | Medium | 52.5% | 23.4% |
| Sentence Screen Fitting | Medium | 36.4% | 23.4% |
| Paint Fence | Medium | 48.3% | 23.4% |
| Minimum Number of Days to Eat N Oranges | Hard | 36.1% | 23.4% |
| Palindrome Partitioning II | Hard | 36.6% | 22.3% |
| Solving Questions With Brainpower | Medium | 60.2% | 22.3% |
| Unique Binary Search Trees | Medium | 63.3% | 22.3% |
| Best Sightseeing Pair | Medium | 62.7% | 22.3% |
| Longest Palindromic Subsequence After at Most K Operations | Medium | 37.4% | 22.3% |
| Stone Game | Medium | 72.8% | 22.3% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 22.3% |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 22.3% |
| Freedom Trail | Hard | 59.2% | 22.3% |
| Longest Binary Subsequence Less Than or Equal to K | Medium | 52.8% | 22.3% |
| Max Consecutive Ones II | Medium | 51.9% | 22.3% |
| Minimum Window Subsequence | Hard | 43.8% | 22.3% |
| String Transformation | Hard | 26.7% | 22.3% |
| Delete Columns to Make Sorted III | Hard | 72.7% | 22.3% |
| Maximum Number That Sum of the Prices Is Less Than or Equal to K | Medium | 38.5% | 22.3% |
| Minimum Falling Path Sum II | Hard | 63.2% | 22.3% |
| Pizza With 3n Slices | Hard | 53.8% | 22.3% |
| Number of Restricted Paths From First to Last Node | Medium | 40.9% | 22.3% |
| Guess Number Higher or Lower II | Medium | 52.5% | 22.3% |
| Count Fertile Pyramids in a Land | Hard | 66.3% | 22.3% |
| Beautiful Arrangement | Medium | 64.7% | 22.3% |
| Largest Sum of Averages | Medium | 54.8% | 22.3% |
| Numbers With Repeated Digits | Hard | 45.8% | 22.3% |
| Maximum Non Negative Product in a Matrix | Medium | 35.7% | 22.3% |
| Divisor Game | Easy | 71.6% | 21.0% |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% | 21.0% |
| Maximum AND Sum of Array | Hard | 50.7% | 21.0% |
| Super Egg Drop | Hard | 29.9% | 21.0% |
| Maximum Value of K Coins From Piles | Hard | 60.4% | 21.0% |
| Minimum Time to Remove All Cars Containing Illegal Goods | Hard | 42.0% | 21.0% |
| Number of Beautiful Partitions | Hard | 32.8% | 21.0% |
| Longest Line of Consecutive One in Matrix | Medium | 50.6% | 21.0% |
| Number of Ways to Stay in the Same Place After Some Steps | Hard | 50.0% | 21.0% |
| Find Two Non-overlapping Sub-arrays Each With Target Sum | Medium | 36.7% | 21.0% |
| Minimum Cost to Connect Two Groups of Points | Hard | 49.6% | 21.0% |
| Distribute Repeating Integers | Hard | 40.4% | 21.0% |
| Maximum Score from Performing Multiplication Operations | Hard | 43.2% | 21.0% |
| Maximum Number of Groups Getting Fresh Donuts | Hard | 41.5% | 21.0% |
| Longest Chunked Palindrome Decomposition | Hard | 59.0% | 21.0% |
| Profitable Schemes | Hard | 48.2% | 21.0% |
| Super Ugly Number | Medium | 46.0% | 21.0% |
| Shopping Offers | Medium | 52.3% | 21.0% |
| Last Stone Weight II | Medium | 59.3% | 19.6% |
| Partition Array for Maximum Sum | Medium | 77.3% | 19.6% |
| Number of Longest Increasing Subsequence | Medium | 51.4% | 19.6% |
| Integer Break | Medium | 61.9% | 19.6% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 19.6% |
| Scramble String | Hard | 43.9% | 19.6% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 19.6% |
| Different Ways to Add Parentheses | Medium | 73.1% | 19.6% |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.2% | 19.6% |
| Find the Count of Monotonic Pairs I | Hard | 47.5% | 19.6% |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 19.6% |
| 4 Keys Keyboard | Medium | 56.5% | 19.6% |
| Minimum Flips in Binary Tree to Get Result | Hard | 56.8% | 19.6% |
| Bomb Enemy | Medium | 52.8% | 19.6% |
| Maximize Total Cost of Alternating Subarrays | Medium | 29.5% | 19.6% |
| Closest Dessert Cost | Medium | 48.4% | 19.6% |
| Maximize Consecutive Elements in an Array After Modification | Hard | 33.6% | 19.6% |
| Minimum White Tiles After Covering With Carpets | Hard | 38.6% | 19.6% |
| Flip Game II | Medium | 52.3% | 19.6% |
| Check if There Is a Valid Parentheses String Path | Hard | 40.1% | 19.6% |
| Encode String with Shortest Length | Hard | 50.6% | 19.6% |
| Maximum Vacation Days | Hard | 46.7% | 19.6% |
| Coin Path | Hard | 34.2% | 19.6% |
| Campus Bikes II | Medium | 55.8% | 19.6% |
| Minimum Increment Operations to Make Array Beautiful | Medium | 34.7% | 19.6% |
| Shortest Distance to Target Color | Medium | 56.5% | 19.6% |
| Maximum Score After Applying Operations on a Tree | Medium | 47.1% | 19.6% |
| Minimum Sum of Values by Dividing Array | Hard | 27.9% | 19.6% |
| Minimum Path Cost in a Grid | Medium | 67.9% | 19.6% |
| Form Largest Integer With Digits That Add up to Target | Hard | 49.5% | 19.6% |
| The Most Similar Path in a Graph | Hard | 59.4% | 19.6% |
| Count Ways to Distribute Candies | Hard | 63.8% | 19.6% |
| Number of Ways to Rearrange Sticks With K Sticks Visible | Hard | 60.5% | 19.6% |
| Minimum Cost to Change the Final Value of Expression | Hard | 51.2% | 19.6% |
| Minimum Skips to Arrive at Meeting On Time | Hard | 38.8% | 19.6% |
| Number of Stable Subsequences | Hard | 60.1% | 19.6% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 18.1% |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 18.1% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 18.1% |
| Find the Original Typed String II | Hard | 45.6% | 18.1% |
| Delete and Earn | Medium | 57.1% | 18.1% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 18.1% |
| Bitwise ORs of Subarrays | Medium | 56.8% | 18.1% |
| Find the Shortest Superstring | Hard | 45.1% | 18.1% |
| Maximum Absolute Sum of Any Subarray | Medium | 71.2% | 18.1% |
| Number of People Aware of a Secret | Medium | 60.9% | 18.1% |
| Remove Boxes | Hard | 49.3% | 16.5% |
| Cherry Pickup | Hard | 39.1% | 16.5% |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 16.5% |
| 2 Keys Keyboard | Medium | 59.3% | 16.5% |
| Ways to Express an Integer as Sum of Powers | Medium | 49.9% | 16.5% |
| Minimum Increments to Equalize Leaf Paths | Medium | 41.1% | 16.5% |
| Ugly Number II | Medium | 49.5% | 16.5% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 16.5% |
| Best Time to Buy and Sell Stock V | Medium | 60.8% | 16.5% |
| Twisted Mirror Path Count | Medium | 48.1% | 16.5% |
| Number of ZigZag Arrays I | Hard | | 14.7% |
| Maximum Path Score in a Grid | Medium | | 14.7% |
| Find All Possible Stable Binary Arrays I | Medium | | 14.7% |
| Arithmetic Slices | Medium | 64.8% | 14.7% |
| Extra Characters in a String | Medium | 57.3% | 14.7% |
| Count Number of Balanced Permutations | Hard | 49.1% | 14.7% |
| Count the Number of Square-Free Subsets | Medium | 26.4% | 14.7% |
| Count the Number of Powerful Integers | Hard | 46.3% | 14.7% |
| Paint House III | Hard | 61.2% | 14.7% |
| Maximum Length of Repeated Subarray | Medium | 51.3% | 14.7% |
| Find the Minimum Cost Array Permutation | Hard | 25.4% | 14.7% |
| Maximum Score From Grid Operations | Hard | 27.1% | 12.7% |
| Rotate Function | Medium | 45.4% | 12.7% |
| Jump Game V | Hard | 64.8% | 12.7% |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 12.7% |
| Trionic Array II | Hard | 47.3% | 12.7% |
| Painting the Walls | Hard | 48.9% | 12.7% |
| Count Number of Teams | Medium | 70.2% | 12.7% |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 12.7% |
| Count the Number of Ideal Arrays | Hard | 56.9% | 12.7% |
| Maximum Students Taking Exam | Hard | 53.4% | 12.7% |
| Get the Maximum Score | Hard | 40.8% | 12.7% |
| Number of Ways to Assign Edge Weights II | Hard | | 10.5% |
| Jump Game IX | Medium | 23.8% | 10.5% |
| Tallest Billboard | Hard | 51.8% | 10.5% |
| Number of Dice Rolls With Target Sum | Medium | 62.2% | 10.5% |
| Jump Game VI | Medium | 46.4% | 10.5% |
| Stone Game II | Medium | 72.9% | 10.5% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 10.5% |
| Total Characters in String After Transformations II | Hard | 58.1% | 10.5% |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 10.5% |
| Taking Maximum Energy From the Mystic Dungeon | Medium | 61.0% | 10.5% |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 10.5% |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.7% | 10.5% |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | 22.9% | 10.5% |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 10.5% |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 10.5% |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.8% | 10.5% |
| Greatest Sum Divisible by Three | Medium | 57.1% | 10.5% |
| Knight Probability in Chessboard | Medium | 56.9% | 10.5% |
| Distinct Subsequences II | Hard | 44.0% | 10.5% |
| Minimum Total Distance Traveled | Hard | 58.8% | 10.5% |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% | 10.5% |
| Minimum Score Triangulation of Polygon | Medium | 67.4% | 10.5% |
| Can I Win | Medium | 31.0% | 10.5% |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 10.5% |
| Minimum ASCII Delete Sum for Two Strings | Medium | 70.9% | 10.5% |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 10.5% |
| Number of Smooth Descent Periods of a Stock | Medium | 67.7% | 10.5% |
| Total Waviness of Numbers in Range II | Hard | | 8.1% |
| Number of ZigZag Arrays II | Hard | | 8.1% |
| Maximize Cyclic Partition Score | Hard | 12.5% | 8.1% |
| Total Waviness of Numbers in Range I | Medium | 80.5% | 8.1% |
| Minimum Cost Path with Teleportations | Hard | 45.7% | 8.1% |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 8.1% |
| Constrained Subsequence Sum | Hard | 56.4% | 8.1% |
| Binary Tree Cameras | Hard | 47.6% | 8.1% |
| K Inverse Pairs Array | Hard | 49.0% | 8.1% |
| Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | 65.9% | 8.1% |
| Maximum Repeating Substring | Easy | 41.1% | 8.1% |
| Find Weighted Median Node in Tree | Hard | 26.1% | 8.1% |
| Number of Squareful Arrays | Hard | 51.2% | 8.1% |
| Matchsticks to Square | Medium | 41.6% | 8.1% |
| Strange Printer | Hard | 60.9% | 8.1% |
| Find Good Days to Rob the Bank | Medium | 51.4% | 8.1% |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 8.1% |
| Find the String with LCP | Hard | 32.5% | 8.1% |
| Minimum Cost to Reach Destination in Time | Hard | 41.2% | 8.1% |
| Subsequence Sum After Capping Elements | Medium | 25.1% | 8.1% |
| Longest Turbulent Subarray | Medium | 48.9% | 5.5% |
| Number of Ways to Reach a Position After Exactly k Steps | Medium | | 5.5% |
| Minimum Additions to Make Valid String | Medium | 51.0% | 5.5% |
| Find the Maximum Sum of Node Values | Hard | 69.5% | 5.5% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 5.5% |
| Count Palindromic Subsequences | Hard | 41.0% | 5.5% |
| Maximum Subarray Sum with One Deletion | Medium | 46.8% | 5.5% |
| Make Array Non-decreasing or Non-increasing | Hard | 65.6% | 5.5% |
| Sliding Puzzle | Hard | 74.2% | 5.5% |
| Maximum Number of Moves in a Grid | Medium | 58.8% | 5.5% |
| Unique Substrings in Wraparound String | Medium | 42.7% | 5.5% |
| Uncrossed Lines | Medium | 65.1% | 5.5% |
| Total Appeal of A String | Hard | 56.4% | 5.5% |
| Find the Maximum Number of Fruits Collected | Hard | 65.1% | 5.5% |
| Length of Longest V-Shaped Diagonal Segment | Hard | 56.3% | 5.5% |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 5.5% |
| Total Characters in String After Transformations I | Medium | 45.7% | 5.5% |
| Stone Game VII | Medium | 58.7% | 5.5% |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 5.5% |
| Maximum Product of the Length of Two Palindromic Subsequences | Medium | 62.4% | 5.5% |
| Reducing Dishes | Hard | 76.7% | 5.5% |
| Allocate Mailboxes | Hard | 56.5% | 5.5% |
| Count Distinct Integers After Removing Zeros | Medium | 22.4% | 5.5% |
| Maximum Profit from Trading Stocks with Discounts | Hard | 56.8% | 5.5% |
| Maximum Length of Pair Chain | Medium | 61.6% | 5.5% |
| Egg Drop With 2 Eggs and N Floors | Medium | 74.6% | 5.5% |
| Count Ways To Build Good Strings | Medium | 59.0% | 5.5% |
| Closest Subsequence Sum | Hard | 43.2% | 5.5% |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 5.5% |
| Make the XOR of All Segments Equal to Zero | Hard | 41.0% | 5.5% |
| Count The Repetitions | Hard | 33.7% | 5.5% |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 5.5% |
| Path Existence Queries in a Graph II | Hard | 26.2% | 5.5% |
| Maximum Amount of Money Robot Can Earn | Medium | 29.5% | 5.5% |
| Best Team With No Conflicts | Medium | 50.6% | 5.5% |
| Count Sequences to K | Hard | | 5.0% |
| Stickers to Spell Word | Hard | 50.6% | 5.0% |
| Count All Valid Pickup and Delivery Options | Hard | 64.9% | 5.0% |
| Minimum Sideway Jumps | Medium | 51.5% | 5.0% |
| Check if There is a Valid Partition For The Array | Medium | 52.2% | 5.0% |
| Poor Pigs | Hard | 59.1% | 5.0% |
| Paint House | Medium | 64.3% | 5.0% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% | 5.0% |
| Minimum Operations to Make Array Equal to Target | Hard | 41.3% | 5.0% |
| Find the Largest Palindrome Divisible by K | Hard | 16.9% | 5.0% |
| Maximum XOR Score Subarray Queries | Hard | 43.7% | 5.0% |
| Find All Good Strings | Hard | 45.1% | 5.0% |
| Longest Square Streak in an Array | Medium | 53.1% | 5.0% |
| Stone Game V | Hard | 41.6% | 5.0% |
| Find Maximum Removals From Source String | Medium | 39.2% | 5.0% |
| Minimum Operations to Make Character Frequencies Equal | Hard | 26.4% | 5.0% |
| Longest Subsequence With Decreasing Adjacent Difference | Medium | 16.6% | 5.0% |
| Zero Array Transformation IV | Medium | 31.0% | 5.0% |
| Merge Operations for Minimum Travel Time | Hard | 30.7% | 5.0% |
| Minimum Moves to Spread Stones Over Grid | Medium | 45.4% | 5.0% |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 5.0% |
| String Compression II | Hard | 52.2% | 5.0% |
| Longest Repeating Substring | Medium | 63.4% | 5.0% |
| Count Different Palindromic Subsequences | Hard | 47.5% | 5.0% |
| Longest Palindrome After Substring Concatenation I | Medium | 43.8% | 5.0% |
| Minimum Cost to Convert String II | Hard | 59.7% | 5.0% |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 5.0% |
| Minimum Array Sum | Medium | 31.0% | 5.0% |
| Maximum Alternating Subsequence Sum | Medium | 59.0% | 5.0% |
| Count The Number of Winning Sequences | Hard | 32.0% | 5.0% |
| Longest Palindrome After Substring Concatenation II | Hard | 17.7% | 5.0% |
| Split Array With Same Average | Hard | 26.8% | 5.0% |
| Count Substrings Divisible By Last Digit | Hard | | 5.0% |
| Find Minimum Cost to Remove Array Elements | Medium | 21.3% | 5.0% |
| Count Number of Ways to Place Houses | Medium | 43.8% | 5.0% |
| Binary Trees With Factors | Medium | 53.1% | 5.0% |
| Zuma Game | Hard | 30.2% | 5.0% |
| Count the Number of Inversions | Hard | 29.7% | 5.0% |
| The Number of Beautiful Subsets | Medium | 50.9% | 5.0% |
| Restore The Array | Hard | 46.8% | 5.0% |
| As Far from Land as Possible | Medium | 52.2% | 5.0% |
| K-Concatenation Maximum Sum | Medium | 25.2% | 5.0% |
| Count Sorted Vowel Strings | Medium | 79.2% | 5.0% |
| Partition Array to Minimize XOR | Medium | 41.0% | 5.0% |
| Find the Number of Subsequences With Equal GCD | Hard | 31.5% | 5.0% |
| Count Beautiful Numbers | Hard | | 5.0% |
| Numbers At Most N Given Digit Set | Hard | 44.6% | 5.0% |
| Minimum XOR Path in a Grid | Medium | | 5.0% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 5.0% |
| Count Stepping Numbers in Range | Hard | 27.8% | 5.0% |
| Find the Sum of the Power of All Subsequences | Hard | 38.1% | 5.0% |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 5.0% |
| Longest Palindromic Path in Graph | Hard | | 5.0% |
| Minimize the Difference Between Target and Chosen Elements | Medium | 36.7% | 5.0% |
| Dice Roll Simulation | Hard | 50.7% | 5.0% |