| Trapping Rain Water | Hard | 66.8% | 73.9% |
| Median of Two Sorted Arrays | Hard | 46.0% | 73.9% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 57.8% |
| N-Queens | Hard | 75.0% | 57.2% |
| Largest Rectangle in Histogram | Hard | 49.4% | 57.2% |
| Split Array Largest Sum | Hard | 59.9% | 56.9% |
| Viewers Turned Streamers | Hard | 42.7% | 54.9% |
| Sliding Window Maximum | Hard | 48.5% | 53.8% |
| Russian Doll Envelopes | Hard | 37.7% | 53.4% |
| Regular Expression Matching | Hard | 30.5% | 52.8% |
| Number of Visible People in a Queue | Hard | 72.4% | 52.6% |
| Find Median from Data Stream | Hard | 54.2% | 52.0% |
| Basic Calculator | Hard | 46.6% | 51.3% |
| Maximal Rectangle | Hard | 58.1% | 51.1% |
| Merge k Sorted Lists | Hard | 58.9% | 50.1% |
| Count Number of Trapezoids II | Hard | 40.1% | 49.2% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 48.8% |
| First Missing Positive | Hard | 42.5% | 48.5% |
| Sudoku Solver | Hard | 65.4% | 47.6% |
| Candy | Hard | 48.0% | 47.1% |
| Reverse Nodes in k-Group | Hard | 65.4% | 46.8% |
| Guess the Word | Hard | 36.9% | 46.3% |
| Text Justification | Hard | 50.5% | 45.5% |
| Reverse Pairs | Hard | 33.7% | 44.3% |
| Wildcard Matching | Hard | 31.4% | 44.3% |
| Range Module | Hard | 44.7% | 43.4% |
| Minimum Window Substring | Hard | 47.0% | 42.7% |
| Finding MK Average | Hard | 38.7% | 42.7% |
| Meeting Rooms III | Hard | 51.6% | 42.4% |
| Word Ladder | Hard | 44.9% | 41.7% |
| Burst Balloons | Hard | 63.0% | 41.3% |
| Swim in Rising Water | Hard | 67.6% | 40.2% |
| Longest Valid Parentheses | Hard | 38.1% | 39.8% |
| 24 Game | Hard | 59.3% | 39.8% |
| Trapping Rain Water II | Hard | 64.0% | 39.3% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 38.5% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 38.5% |
| Shortest Palindrome | Hard | 41.9% | 38.5% |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 38.0% |
| LFU Cache | Hard | 48.6% | 37.6% |
| Expression Add Operators | Hard | 42.8% | 37.6% |
| Permutation Sequence | Hard | 52.2% | 37.1% |
| Number of Islands II | Hard | 40.4% | 37.1% |
| Race Car | Hard | 44.6% | 37.1% |
| Odd Even Jump | Hard | 41.1% | 37.1% |
| Lexicographically Smallest Beautiful String | Hard | 38.1% | 37.1% |
| Alien Dictionary | Hard | 37.1% | 36.6% |
| Word Search II | Hard | 38.1% | 36.6% |
| Minimum Time to Finish the Race | Hard | 43.3% | 35.6% |
| Substring with Concatenation of All Words | Hard | 34.0% | 35.1% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 35.1% |
| Integer to English Words | Hard | 34.8% | 34.5% |
| Bus Routes | Hard | 47.1% | 33.9% |
| Subarrays with K Different Integers | Hard | 67.6% | 33.9% |
| Count of Smaller Numbers After Self | Hard | 43.3% | 33.9% |
| Next Special Palindrome Number | Hard | 27.9% | 33.9% |
| The Skyline Problem | Hard | 45.0% | 33.9% |
| Height of Binary Tree After Subtree Removal Queries | Hard | 54.9% | 33.3% |
| Minimum Weighted Subgraph With the Required Paths | Hard | 41.1% | 33.3% |
| Sum of Distances in Tree | Hard | 65.5% | 32.7% |
| Reconstruct Itinerary | Hard | 44.3% | 32.7% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 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% |
| Time Taken to Cross the Door | Hard | 50.1% | 32.0% |
| Making A Large Island | Hard | 56.3% | 31.4% |
| Word Break II | Hard | 55.1% | 31.4% |
| Find in Mountain Array | Hard | 41.2% | 30.7% |
| Minimum Interval to Include Each Query | Hard | 54.0% | 30.7% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 30.7% |
| Sliding Window Median | Hard | 38.9% | 30.7% |
| Number of Digit One | Hard | 37.7% | 29.9% |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 29.9% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 29.9% |
| Robot Room Cleaner | Hard | 77.9% | 29.9% |
| Design a Text Editor | Hard | 50.1% | 29.9% |
| Word Ladder II | Hard | 27.5% | 29.1% |
| Longest Duplicate Substring | Hard | 31.1% | 29.1% |
| Student Attendance Record II | Hard | 56.4% | 29.1% |
| Maximum Number of Ways to Partition an Array | Hard | 35.6% | 29.1% |
| Create Maximum Number | Hard | 34.7% | 29.1% |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 29.1% |
| Max Points on a Line | Hard | 30.3% | 28.3% |
| Palindrome Pairs | Hard | 37.0% | 28.3% |
| Sum of Good Subsequences | Hard | 30.8% | 28.3% |
| Maximum Score of a Node Sequence | Hard | 39.8% | 28.3% |
| Optimal Account Balancing | Hard | 50.3% | 28.3% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 27.5% |
| Shortest Common Supersequence | Hard | 61.8% | 27.5% |
| Shortest Distance from All Buildings | Hard | 44.9% | 27.5% |
| Parallel Courses II | Hard | 30.6% | 27.5% |
| Maximum Number of K-Divisible Components | Hard | 74.1% | 27.5% |
| Stone Game III | Hard | 63.3% | 27.5% |
| Design Search Autocomplete System | Hard | 49.7% | 26.5% |
| Find All People With Secret | Hard | 48.4% | 26.5% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 26.5% |
| Distinct Subsequences | Hard | 51.5% | 26.5% |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 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% |
| Count of Range Sum | Hard | 38.3% | 25.6% |
| All O`one Data Structure | Hard | 44.2% | 25.6% |
| Cat and Mouse | Hard | 34.8% | 25.6% |
| Number of Unique Good Subsequences | Hard | 52.6% | 25.6% |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 25.6% |
| Number of Flowers in Full Bloom | Hard | 57.7% | 25.6% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.5% | 25.6% |
| Minimum Distance to Type a Word Using Two Fingers | Hard | 59.4% | 24.5% |
| Jump Game IV | Hard | 46.2% | 24.5% |
| Employee Free Time | Hard | 72.8% | 24.5% |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 24.5% |
| Find the Maximum Sequence Value of Array | Hard | 21.2% | 24.5% |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% | 24.5% |
| Count Non-Decreasing Subarrays After K Operations | Hard | 23.8% | 24.5% |
| Dungeon Game | Hard | 40.9% | 24.5% |
| Maximum XOR With an Element From Array | Hard | 57.6% | 24.5% |
| Cracking the Safe | Hard | 58.4% | 24.5% |
| Largest Component Size by Common Factor | Hard | 42.4% | 24.5% |
| Build a Matrix With Conditions | Hard | 79.3% | 24.5% |
| Rank Transform of a Matrix | Hard | 42.1% | 24.5% |
| Similar String Groups | Hard | 56.1% | 24.5% |
| Stream of Characters | Hard | 52.0% | 24.5% |
| Number of Good Paths | Hard | 56.3% | 24.5% |
| Number of Atoms | Hard | 65.1% | 24.5% |
| Cherry Pickup II | Hard | 72.3% | 24.5% |
| Tiling a Rectangle with the Fewest Squares | Hard | 54.8% | 24.5% |
| Number of Ways of Cutting a Pizza | Hard | 61.6% | 24.5% |
| Frog Jump | Hard | 47.1% | 23.4% |
| Cat and Mouse II | Hard | 40.4% | 23.4% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 23.4% |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 23.4% |
| Maximum Score of a Good Subarray | Hard | 64.4% | 23.4% |
| Parallel Courses III | Hard | 66.8% | 23.4% |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 23.4% |
| Patching Array | Hard | 54.1% | 23.4% |
| Redundant Connection II | Hard | 35.9% | 23.4% |
| Car Fleet II | Hard | 57.8% | 23.4% |
| Checking Existence of Edge Length Limited Paths | Hard | 63.2% | 23.4% |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 23.4% |
| Perfect Rectangle | Hard | 37.3% | 23.4% |
| Check if DFS Strings Are Palindromes | Hard | 20.1% | 23.4% |
| Smallest Rectangle Enclosing Black Pixels | Hard | 60.8% | 23.4% |
| Rearrange String k Distance Apart | Hard | 39.9% | 23.4% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 23.4% |
| Minimize Max Distance to Gas Station | Hard | 53.9% | 23.4% |
| Minimum Number of Days to Eat N Oranges | Hard | 36.1% | 23.4% |
| Palindrome Partitioning II | Hard | 36.6% | 22.3% |
| Longest Balanced Subarray II | Hard | 33.8% | 22.3% |
| Find the Number of Ways to Place People II | Hard | 64.4% | 22.3% |
| Critical Connections in a Network | Hard | 59.3% | 22.3% |
| Find Minimum in Rotated Sorted Array II | Hard | 44.7% | 22.3% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 22.3% |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 22.3% |
| Minimum Cost to Hire K Workers | Hard | 63.6% | 22.3% |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 22.3% |
| Freedom Trail | Hard | 59.2% | 22.3% |
| Reaching Points | Hard | 34.2% | 22.3% |
| Shortest Path to Get All Keys | Hard | 54.3% | 22.3% |
| Couples Holding Hands | Hard | 59.2% | 22.3% |
| Sum of Prefix Scores of Strings | Hard | 60.8% | 22.3% |
| Smallest Good Base | Hard | 45.5% | 22.3% |
| Minimum Window Subsequence | Hard | 43.8% | 22.3% |
| My Calendar III | Hard | 71.5% | 22.3% |
| K-Similar Strings | Hard | 40.6% | 22.3% |
| String Transformation | Hard | 26.7% | 22.3% |
| Delete Columns to Make Sorted III | Hard | 72.7% | 22.3% |
| Minimum Falling Path Sum II | Hard | 63.2% | 22.3% |
| Pizza With 3n Slices | Hard | 53.8% | 22.3% |
| Max Value of Equation | Hard | 45.0% | 22.3% |
| Minimum Adjacent Swaps for K Consecutive Ones | Hard | 42.3% | 22.3% |
| Count Fertile Pyramids in a Land | Hard | 66.3% | 22.3% |
| Numbers With Repeated Digits | Hard | 45.8% | 22.3% |
| Longest Common Suffix Queries | Hard | 35.9% | 22.3% |
| Last Day Where You Can Still Cross | Hard | 68.6% | 21.0% |
| Separate Squares II | Hard | 59.9% | 21.0% |
| Basic Calculator III | Hard | 53.2% | 21.0% |
| Parsing A Boolean Expression | Hard | 69.8% | 21.0% |
| Maximize Subarray GCD Score | Hard | 24.7% | 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% |
| Count K-Subsequences of a String With Maximum Beauty | Hard | 30.2% | 21.0% |
| Erect the Fence | Hard | 52.7% | 21.0% |
| Super Egg Drop | Hard | 29.9% | 21.0% |
| Maximum Value of K Coins From Piles | Hard | 60.4% | 21.0% |
| Longest Happy Prefix | Hard | 51.9% | 21.0% |
| Minimum Time to Remove All Cars Containing Illegal Goods | Hard | 42.0% | 21.0% |
| Closest Binary Search Tree Value II | Hard | 61.1% | 21.0% |
| Number of Beautiful Partitions | Hard | 32.8% | 21.0% |
| Word Abbreviation | Hard | 62.7% | 21.0% |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 21.0% |
| K Empty Slots | Hard | 37.9% | 21.0% |
| Sum of Imbalance Numbers of All Subarrays | Hard | 43.2% | 21.0% |
| Bricks Falling When Hit | Hard | 36.9% | 21.0% |
| Super Palindromes | Hard | 39.8% | 21.0% |
| Brace Expansion II | Hard | 63.9% | 21.0% |
| Divide Chocolate | Hard | 60.5% | 21.0% |
| Number of Ways to Stay in the Same Place After Some Steps | Hard | 50.0% | 21.0% |
| Minimum Cost to Connect Two Groups of Points | Hard | 49.6% | 21.0% |
| Distribute Repeating Integers | Hard | 40.4% | 21.0% |
| Minimum Operations to Make a Subsequence | Hard | 49.6% | 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% |
| Number of Pairs Satisfying Inequality | Hard | 46.8% | 21.0% |
| Distinct Echo Substrings | Hard | 53.0% | 21.0% |
| Strange Printer II | Hard | 60.7% | 21.0% |
| Fancy Sequence | Hard | 18.6% | 21.0% |
| 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% |
| Top Three Wineries | Hard | 53.6% | 19.6% |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% | 19.6% |
| N-Queens II | Hard | 78.2% | 19.6% |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 19.6% |
| Find the Count of Monotonic Pairs I | Hard | 47.5% | 19.6% |
| Optimize Water Distribution in a Village | Hard | 65.5% | 19.6% |
| Frog Position After T Seconds | Hard | 37.9% | 19.6% |
| Minimum Flips in Binary Tree to Get Result | Hard | 56.8% | 19.6% |
| Amount of New Area Painted Each Day | Hard | 55.6% | 19.6% |
| Count the Number of Good Partitions | Hard | 49.0% | 19.6% |
| Median Employee Salary | Hard | 65.9% | 19.6% |
| Count Subarrays With Median K | Hard | 47.7% | 19.6% |
| Maximize Consecutive Elements in an Array After Modification | Hard | 33.6% | 19.6% |
| Erect the Fence II | Hard | 51.4% | 19.6% |
| Process Restricted Friend Requests | Hard | 59.5% | 19.6% |
| Recover the Original Array | Hard | 41.3% | 19.6% |
| Minimum White Tiles After Covering With Carpets | Hard | 38.6% | 19.6% |
| Check if There Is a Valid Parentheses String Path | Hard | 40.1% | 19.6% |
| Booking Concert Tickets in Groups | Hard | 19.2% | 19.6% |
| Design Video Sharing Platform | Hard | 64.1% | 19.6% |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.3% | 19.6% |
| Shortest Impossible Sequence of Rolls | Hard | 69.2% | 19.6% |
| Minimum Unique Word Abbreviation | Hard | 40.5% | 19.6% |
| Word Squares | Hard | 54.6% | 19.6% |
| Sort Array by Moving Items to Empty Space | Hard | 45.7% | 19.6% |
| Minimize Maximum Value in a Grid | Hard | 70.2% | 19.6% |
| Encode String with Shortest Length | Hard | 50.6% | 19.6% |
| Maximum Vacation Days | Hard | 46.7% | 19.6% |
| Maximum Average Subarray II | Hard | 37.7% | 19.6% |
| Coin Path | Hard | 34.2% | 19.6% |
| Transform to Chessboard | Hard | 51.2% | 19.6% |
| Random Pick with Blacklist | Hard | 34.6% | 19.6% |
| Confusing Number II | Hard | 47.1% | 19.6% |
| Divide Array Into Increasing Sequences | Hard | 65.4% | 19.6% |
| String Transforms Into Another String | Hard | 34.7% | 19.6% |
| Minimum Time to Build Blocks | Hard | 46.4% | 19.6% |
| Minimum Sum of Values by Dividing Array | Hard | 27.9% | 19.6% |
| Design Skiplist | Hard | 59.5% | 19.6% |
| Form Largest Integer With Digits That Add up to Target | Hard | 49.5% | 19.6% |
| Move Sub-Tree of N-Ary Tree | Hard | 59.8% | 19.6% |
| The Most Similar Path in a Graph | Hard | 59.4% | 19.6% |
| Check If String Is Transformable With Substring Sort Operations | Hard | 51.1% | 19.6% |
| Count Ways to Distribute Candies | Hard | 63.8% | 19.6% |
| Checking Existence of Edge Length Limited Paths II | Hard | 51.8% | 19.6% |
| Tree of Coprimes | Hard | 43.8% | 19.6% |
| Find the Subtasks That Did Not Execute | Hard | 78.3% | 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% |
| Special Binary String | Hard | 79.3% | 18.1% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 18.1% |
| Unique Paths III | Hard | 82.8% | 18.1% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 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% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 18.1% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 18.1% |
| Find the Shortest Superstring | Hard | 45.1% | 18.1% |
| Valid Number | Hard | 22.6% | 18.1% |
| Maximize Alternating Sum Using Swaps | Hard | 64.1% | 18.1% |
| Remove Boxes | Hard | 49.3% | 16.5% |
| Cherry Pickup | Hard | 39.1% | 16.5% |
| Maximum Running Time of N Computers | Hard | 56.4% | 16.5% |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% | 16.5% |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 16.5% |
| Rearranging Fruits | Hard | 57.5% | 16.5% |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% | 16.5% |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 16.5% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 16.5% |
| Department Top Three Salaries | Hard | 59.9% | 16.5% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 16.5% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 16.5% |
| Threshold Majority Queries | Hard | 21.7% | 16.5% |
| Number of ZigZag Arrays I | Hard | | 14.7% |
| Trips and Users | Hard | 37.7% | 14.7% |
| Remove Invalid Parentheses | Hard | 49.8% | 14.7% |
| Count Number of Balanced Permutations | Hard | 49.1% | 14.7% |
| Sum of k-Mirror Numbers | Hard | 63.8% | 14.7% |
| Count the Number of Powerful Integers | Hard | 46.3% | 14.7% |
| Paint House III | Hard | 61.2% | 14.7% |
| IPO | Hard | 53.3% | 14.7% |
| Find the Minimum Cost Array Permutation | Hard | 25.4% | 14.7% |
| Block Placement Queries | Hard | 18.4% | 12.7% |
| Maximum Score From Grid Operations | Hard | 27.1% | 12.7% |
| Minimum Initial Energy to Finish Tasks | Hard | 60.7% | 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% |
| Count Subarrays With Fixed Bounds | Hard | 69.2% | 12.7% |
| Painting the Walls | Hard | 48.9% | 12.7% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 12.7% |
| Find the Count of Good Integers | Hard | 69.5% | 12.7% |
| Design Excel Sum Formula | Hard | 39.9% | 12.7% |
| Longest Subsequence Repeated k Times | Hard | 71.3% | 12.7% |
| Count the Number of Ideal Arrays | Hard | 56.9% | 12.7% |
| Set Intersection Size At Least Two | Hard | 57.9% | 12.7% |
| Maximum Students Taking Exam | Hard | 53.4% | 12.7% |
| Contains Duplicate III | Hard | 24.5% | 12.7% |
| Nth Magical Number | Hard | 36.4% | 12.7% |
| Maximum Fruits Harvested After at Most K Steps | Hard | 61.0% | 12.7% |
| Get the Maximum Score | Hard | 40.8% | 12.7% |
| Minimum Operations to Make Array Elements Zero | Hard | 60.4% | 12.7% |
| Number of Ways to Assign Edge Weights II | Hard | | 10.5% |
| Tallest Billboard | Hard | 51.8% | 10.5% |
| Find the Closest Palindrome | Hard | 31.8% | 10.5% |
| Escape the Spreading Fire | Hard | 37.6% | 10.5% |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 10.5% |
| Second Minimum Time to Reach Destination | Hard | 62.4% | 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% |
| 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 Difference Between Even and Odd Frequency II | Hard | 48.7% | 10.5% |
| Apply Operations to Maximize Score | Hard | 53.7% | 10.5% |
| Count Good Triplets in an Array | Hard | 65.8% | 10.5% |
| Put Marbles in Bags | Hard | 72.2% | 10.5% |
| Find the Occurrence of First Almost Equal Substring | Hard | 15.3% | 10.5% |
| Find the K-th Character in String Game II | Hard | 48.5% | 10.5% |
| Maximize the Minimum Powered City | Hard | 61.8% | 10.5% |
| Distinct Subsequences II | Hard | 44.0% | 10.5% |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 10.5% |
| Design In-Memory File System | Hard | 48.4% | 10.5% |
| Minimum Total Distance Traveled | Hard | 58.8% | 10.5% |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% | 10.5% |
| Maximum Number of Visible Points | Hard | 38.0% | 10.5% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 10.5% |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 10.5% |
| Process String with Special Operations II | Hard | 16.9% | 10.5% |
| Total Waviness of Numbers in Range II | Hard | | 8.1% |
| Number of ZigZag Arrays II | Hard | | 8.1% |
| Lexicographically Smallest Generated String | Hard | 31.5% | 8.1% |
| Maximize the Distance Between Points on a Square | Hard | | 8.1% |
| Maximize Cyclic Partition Score | Hard | 12.5% | 8.1% |
| Minimum Cost Path with Teleportations | Hard | 45.7% | 8.1% |
| Maximize Spanning Tree Stability with Upgrades | Hard | | 8.1% |
| Equal Sum Grid Partition II | Hard | | 8.1% |
| Minimum Deletions to Make Array Divisible | Hard | 60.0% | 8.1% |
| Find Nth Smallest Integer With K One Bits | Hard | 34.1% | 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% |
| Modify Graph Edge Weights | Hard | 55.6% | 8.1% |
| Basic Calculator IV | Hard | 49.7% | 8.1% |
| Delete Duplicate Folders in System | Hard | 77.7% | 8.1% |
| Best Meeting Point | Hard | 61.4% | 8.1% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 8.1% |
| Find Weighted Median Node in Tree | Hard | 26.1% | 8.1% |
| Maximize the Number of Target Nodes After Connecting Trees II | Hard | 73.2% | 8.1% |
| Number of Squareful Arrays | Hard | 51.2% | 8.1% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 8.1% |
| Find X-Sum of All K-Long Subarrays II | Hard | 41.1% | 8.1% |
| Longest Cycle in a Graph | Hard | 50.5% | 8.1% |
| Strange Printer | Hard | 60.9% | 8.1% |
| Rectangle Area II | Hard | 55.9% | 8.1% |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 8.1% |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 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% |
| Check If It Is a Good Array | Hard | 63.4% | 8.1% |
| Parse Lisp Expression | Hard | 53.5% | 8.1% |
| Minimum Cost to Reach Destination in Time | Hard | 41.2% | 8.1% |
| Minimum Operations to Equalize Binary String | Hard | 45.6% | 8.1% |
| Minimum Moves to Move a Box to Their Target Location | Hard | 49.5% | 8.1% |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% | 5.5% |
| Robot Collisions | Hard | 56.1% | 5.5% |
| Maximum Performance of a Team | Hard | 47.7% | 5.5% |
| Find the Maximum Sum of Node Values | Hard | 69.5% | 5.5% |
| Max Stack | Hard | 45.9% | 5.5% |
| Consecutive Numbers Sum | Hard | 42.6% | 5.5% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 5.5% |
| Count Palindromic Subsequences | Hard | 41.0% | 5.5% |
| Chalkboard XOR Game | Hard | 65.8% | 5.5% |
| Make Array Non-decreasing or Non-increasing | Hard | 65.6% | 5.5% |
| Sliding Puzzle | Hard | 74.2% | 5.5% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 5.5% |
| Manhattan Distances of All Arrangements of Pieces | Hard | 35.1% | 5.5% |
| Number of Distinct Islands II | Hard | 55.3% | 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% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 5.5% |
| Longest Special Path II | Hard | 18.5% | 5.5% |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 5.5% |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 5.5% |
| Reducing Dishes | Hard | 76.7% | 5.5% |
| Allocate Mailboxes | Hard | 56.5% | 5.5% |
| Find the Minimum Area to Cover All Ones II | Hard | 63.6% | 5.5% |
| Partition Array for Maximum XOR and AND | Hard | 17.5% | 5.5% |
| Divide an Array Into Subarrays With Minimum Cost II | Hard | 54.7% | 5.5% |
| Maximum Profit from Trading Stocks with Discounts | Hard | 56.8% | 5.5% |
| Verbal Arithmetic Puzzle | Hard | 34.9% | 5.5% |
| Super Washing Machines | Hard | 43.9% | 5.5% |
| Closest Subsequence Sum | Hard | 43.2% | 5.5% |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 5.5% |
| Strong Password Checker | Hard | 15.5% | 5.5% |
| Make the XOR of All Segments Equal to Zero | Hard | 41.0% | 5.5% |
| Data Stream as Disjoint Intervals | Hard | 60.0% | 5.5% |
| Count The Repetitions | Hard | 33.7% | 5.5% |
| Maximum Frequency Stack | Hard | 66.6% | 5.5% |
| Minimum Cost to Make Array Equal | Hard | 46.7% | 5.5% |
| Collect Coins in a Tree | Hard | 39.7% | 5.5% |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 5.5% |
| Apply Operations to Maximize Frequency Score | Hard | 38.6% | 5.5% |
| Path Existence Queries in a Graph II | Hard | 26.2% | 5.5% |
| Maximum Total Subarray Value II | Hard | | 5.0% |
| Human Traffic of Stadium | Hard | 50.8% | 5.0% |
| Count Sequences to K | Hard | | 5.0% |
| Maximum Partition Factor | Hard | 31.1% | 5.0% |
| Maximum Subarray Sum After at Most K Swaps | Hard | | 5.0% |
| Stickers to Spell Word | Hard | 50.6% | 5.0% |
| Count All Valid Pickup and Delivery Options | Hard | 64.9% | 5.0% |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% | 5.0% |
| Poor Pigs | Hard | 59.1% | 5.0% |
| Prefix and Suffix Search | Hard | 40.8% | 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% |
| Sorted GCD Pair Queries | Hard | 22.3% | 5.0% |
| Maximum Number of Moves to Kill All Pawns | Hard | 33.7% | 5.0% |
| Stone Game V | Hard | 41.6% | 5.0% |
| Minimum Operations to Make Character Frequencies Equal | Hard | 26.4% | 5.0% |
| Maximum Path Quality of a Graph | Hard | 61.7% | 5.0% |
| Smallest Substring With Identical Characters I | Hard | 20.4% | 5.0% |
| Encrypt and Decrypt Strings | Hard | 38.1% | 5.0% |
| Contain Virus | Hard | 54.4% | 5.0% |
| Merge Operations for Minimum Travel Time | Hard | 30.7% | 5.0% |
| Closest Node to Path in Tree | Hard | 62.4% | 5.0% |
| Minimize Malware Spread | Hard | 43.0% | 5.0% |
| Length of the Longest Valid Substring | Hard | 38.2% | 5.0% |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 5.0% |
| String Compression II | Hard | 52.2% | 5.0% |
| Equal Rational Numbers | Hard | 45.9% | 5.0% |
| Earliest Second to Mark Indices II | Hard | 22.0% | 5.0% |
| Count Integers in Intervals | Hard | 35.7% | 5.0% |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 5.0% |
| The Maze III | Hard | 52.3% | 5.0% |
| Create Sorted Array through Instructions | Hard | 41.4% | 5.0% |
| Count Different Palindromic Subsequences | Hard | 47.5% | 5.0% |
| Find the K-Sum of an Array | Hard | 41.1% | 5.0% |
| Minimum Score After Removals on a Tree | Hard | 76.2% | 5.0% |
| Minimum Cost to Convert String II | Hard | 59.7% | 5.0% |
| Check If Digits Are Equal in String After Operations II | Hard | 14.2% | 5.0% |
| Sum of Beautiful Subsequences | Hard | 31.3% | 5.0% |
| Find Substring With Given Hash Value | Hard | 26.0% | 5.0% |
| Count The Number of Winning Sequences | Hard | 32.0% | 5.0% |
| Maximum Area Rectangle With Point Constraints II | Hard | 23.7% | 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% |
| Escape a Large Maze | Hard | 36.3% | 5.0% |
| Sum of Perfect Square Ancestors | Hard | 42.5% | 5.0% |
| Number of Valid Move Combinations On Chessboard | Hard | 48.8% | 5.0% |
| Find the Longest Valid Obstacle Course at Each Position | Hard | 62.6% | 5.0% |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 5.0% |
| Make Array Empty | Hard | 26.7% | 5.0% |
| Zuma Game | Hard | 30.2% | 5.0% |
| Count the Number of Inversions | Hard | 29.7% | 5.0% |
| Dinner Plate Stacks | Hard | 33.5% | 5.0% |
| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.4% | 5.0% |
| Minimum Time to Complete All Tasks | Hard | 39.7% | 5.0% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 5.0% |
| Restore The Array | Hard | 46.8% | 5.0% |
| Memoize II | Hard | 38.4% | 5.0% |
| Merge BSTs to Create Single BST | Hard | 38.0% | 5.0% |
| Smallest Divisible Digit Product II | Hard | 14.4% | 5.0% |
| Minimum Pair Removal to Sort Array II | Hard | 39.2% | 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% |
| Valid Arrangement of Pairs | Hard | 66.5% | 5.0% |
| Final Array State After K Multiplication Operations II | Hard | 13.1% | 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% |
| Maximize Count of Distinct Primes After Split | Hard | | 5.0% |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 5.0% |
| Longest Palindromic Path in Graph | Hard | | 5.0% |
| Shortest Cycle in a Graph | Hard | 39.2% | 5.0% |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% | 5.0% |
| Maximum Building Height | Hard | 38.3% | 5.0% |
| Dice Roll Simulation | Hard | 50.7% | 5.0% |
