| Trapping Rain Water | Hard | 66.8% | 87.4% |
| Median of Two Sorted Arrays | Hard | 46.0% | 76.4% |
| Merge k Sorted Lists | Hard | 58.9% | 74.1% |
| Word Ladder | Hard | 44.9% | 69.2% |
| Sliding Window Maximum | Hard | 48.5% | 64.8% |
| Find Median from Data Stream | Hard | 54.2% | 62.3% |
| First Missing Positive | Hard | 42.5% | 60.4% |
| Largest Rectangle in Histogram | Hard | 49.4% | 60.2% |
| N-Queens | Hard | 75.0% | 59.5% |
| Minimum Window Substring | Hard | 47.0% | 59.1% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 58.9% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 57.5% |
| Reverse Nodes in k-Group | Hard | 65.4% | 57.3% |
| LFU Cache | Hard | 48.6% | 56.6% |
| Regular Expression Matching | Hard | 30.5% | 56.3% |
| Word Search II | Hard | 38.1% | 54.4% |
| Candy | Hard | 48.0% | 54.4% |
| Concatenated Words | Hard | 49.7% | 53.6% |
| Basic Calculator | Hard | 46.6% | 52.7% |
| Integer to English Words | Hard | 34.8% | 52.7% |
| Word Break II | Hard | 55.1% | 51.7% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 51.0% |
| Split Array Largest Sum | Hard | 59.9% | 50.7% |
| Longest Valid Parentheses | Hard | 38.1% | 49.6% |
| Sudoku Solver | Hard | 65.4% | 49.2% |
| Subarrays with K Different Integers | Hard | 67.6% | 47.2% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 46.3% |
| Word Ladder II | Hard | 27.5% | 46.3% |
| Reverse Pairs | Hard | 33.7% | 43.9% |
| Maximal Rectangle | Hard | 58.1% | 43.9% |
| Critical Connections in a Network | Hard | 59.3% | 41.6% |
| Trapping Rain Water II | Hard | 64.0% | 41.0% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 40.4% |
| Making A Large Island | Hard | 56.3% | 39.8% |
| Sum of Total Strength of Wizards | Hard | 29.2% | 38.4% |
| Russian Doll Envelopes | Hard | 37.7% | 38.4% |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 37.7% |
| Design In-Memory File System | Hard | 48.4% | 37.7% |
| Wildcard Matching | Hard | 31.4% | 36.9% |
| Alien Dictionary | Hard | 37.1% | 36.9% |
| Bus Routes | Hard | 47.1% | 36.1% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 36.1% |
| Text Justification | Hard | 50.5% | 35.3% |
| Distinct Subsequences | Hard | 51.5% | 35.3% |
| Find Longest Self-Contained Substring | Hard | 58.8% | 35.3% |
| Find the Number of Possible Ways for an Event | Hard | 34.9% | 35.3% |
| Binary Tree Cameras | Hard | 47.6% | 34.4% |
| Substring with Concatenation of All Words | Hard | 34.0% | 34.4% |
| Permutation Sequence | Hard | 52.2% | 34.4% |
| Burst Balloons | Hard | 63.0% | 34.4% |
| Department Top Three Salaries | Hard | 59.9% | 34.4% |
| Reconstruct Itinerary | Hard | 44.3% | 33.5% |
| Put Marbles in Bags | Hard | 72.2% | 33.5% |
| Dungeon Game | Hard | 40.9% | 32.5% |
| Substring With Largest Variance | Hard | 46.0% | 32.5% |
| Frog Jump | Hard | 47.1% | 32.5% |
| Maximum Number of Groups With Increasing Length | Hard | 23.0% | 32.5% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 31.5% |
| Maximum Number of Books You Can Take | Hard | 39.5% | 31.5% |
| Palindrome Partitioning II | Hard | 36.6% | 30.4% |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 30.4% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 30.4% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 30.4% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 30.4% |
| Length of Longest V-Shaped Diagonal Segment | Hard | 56.3% | 30.4% |
| Longest Duplicate Substring | Hard | 31.1% | 30.4% |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 30.4% |
| Total Appeal of A String | Hard | 56.4% | 29.3% |
| Count Subarrays With Median K | Hard | 47.7% | 29.3% |
| Meeting Rooms III | Hard | 51.6% | 29.3% |
| Shortest Palindrome | Hard | 41.9% | 29.3% |
| Minimum Swaps to Avoid Forbidden Values | Hard | 30.2% | 29.3% |
| All O`one Data Structure | Hard | 44.2% | 29.3% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 29.3% |
| Shortest Common Supersequence | Hard | 61.8% | 29.3% |
| Maximum Number of Robots Within Budget | Hard | 38.0% | 29.3% |
| Find the K-Sum of an Array | Hard | 41.1% | 29.3% |
| GCD Sort of an Array | Hard | 48.5% | 29.3% |
| Allocate Mailboxes | Hard | 56.5% | 28.0% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 28.0% |
| Super Washing Machines | Hard | 43.9% | 28.0% |
| Number of Distinct Islands II | Hard | 55.3% | 28.0% |
| Orderly Queue | Hard | 66.7% | 28.0% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 28.0% |
| Count Stepping Numbers in Range | Hard | 27.8% | 28.0% |
| Maximize Fixed Points After Deletions | Hard | | 26.7% |
| Max Points on a Line | Hard | 30.3% | 26.7% |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 26.7% |
| Valid Number | Hard | 22.6% | 26.7% |
| Number of Digit One | Hard | 37.7% | 26.7% |
| N-Queens II | Hard | 78.2% | 26.7% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 26.7% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% | 26.7% |
| Check for Contradictions in Equations | Hard | 43.8% | 26.7% |
| Cut Off Trees for Golf Event | Hard | 36.1% | 26.7% |
| Design a Text Editor | Hard | 50.1% | 26.7% |
| Next Palindrome Using Same Digits | Hard | 54.2% | 26.7% |
| Maximum Bitwise AND After Increment Operations | Hard | 31.0% | 25.3% |
| Maximum Frequency Stack | Hard | 66.6% | 25.3% |
| Unique Paths III | Hard | 82.8% | 25.3% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 25.3% |
| Design an Array Statistics Tracker | Hard | 35.7% | 25.3% |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% | 25.3% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.3% |
| Design Search Autocomplete System | Hard | 49.7% | 25.3% |
| Swim in Rising Water | Hard | 67.6% | 25.3% |
| Maximum Number of Non-Overlapping Substrings | Hard | 41.5% | 25.3% |
| Maximum Number of Achievable Transfer Requests | Hard | 64.6% | 25.3% |
| Length of the Longest Valid Substring | Hard | 38.2% | 25.3% |
| Longest Common Subpath | Hard | 29.4% | 25.3% |
| Customers With Strictly Increasing Purchases | Hard | 49.5% | 25.3% |
| Time Taken to Cross the Door | Hard | 50.1% | 25.3% |
| Find Number of Coins to Place in Tree Nodes | Hard | 37.3% | 25.3% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 25.3% |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 25.3% |
| Find Number of Ways to Reach the K-th Stair | Hard | 37.5% | 25.3% |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.3% | 25.3% |
| Minimum Score After Removals on a Tree | Hard | 76.2% | 25.3% |
| Closest Room | Hard | 41.1% | 25.3% |
| Sales by Day of the Week | Hard | 76.3% | 25.3% |
| Handshakes That Don't Cross | Hard | 59.9% | 25.3% |
| IPO | Hard | 53.3% | 23.7% |
| Lexicographically Maximum MEX Array | Hard | | 23.7% |
| Parsing A Boolean Expression | Hard | 69.8% | 23.7% |
| The Skyline Problem | Hard | 45.0% | 23.7% |
| Max Stack | Hard | 45.9% | 23.7% |
| Shortest Matching Substring | Hard | 23.8% | 23.7% |
| Find in Mountain Array | Hard | 41.2% | 23.7% |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 23.7% |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% | 23.7% |
| Sum of Scores of Built Strings | Hard | 46.7% | 23.7% |
| Count the Number of K-Big Indices | Hard | 53.6% | 23.7% |
| Count Number of Special Subsequences | Hard | 52.7% | 23.7% |
| Digit Count in Range | Hard | 46.4% | 23.7% |
| Find Cumulative Salary of an Employee | Hard | 49.3% | 23.7% |
| Subarrays Distinct Element Sum of Squares II | Hard | 22.8% | 23.7% |
| Maximum Balanced Subsequence Sum | Hard | 25.8% | 23.7% |
| Count Beautiful Substrings II | Hard | 26.8% | 23.7% |
| Distribute Candies Among Children III | Hard | 57.2% | 23.7% |
| Sequentially Ordinal Rank Tracker | Hard | 61.5% | 23.7% |
| Minimum Operations to Make the Array K-Increasing | Hard | 40.2% | 23.7% |
| Build Binary Expression Tree From Infix Expression | Hard | 62.8% | 23.7% |
| Minimum Operations to Remove Adjacent Ones in Matrix | Hard | 42.9% | 23.7% |
| Largest Multiple of Three | Hard | 33.1% | 23.7% |
| Longest Winning Streak | Hard | 54.2% | 23.7% |
| Count Ways to Make Array With Product | Hard | 54.4% | 23.7% |
| Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | 32.8% | 23.7% |
| Count Pairs Of Nodes | Hard | 42.5% | 23.7% |
| Maximize the Beauty of the Garden | Hard | 64.6% | 23.7% |
| Numbers At Most N Given Digit Set | Hard | 44.6% | 23.7% |
| Minimum Money Required Before Transactions | Hard | 42.0% | 23.7% |
| Minimum Space Wasted From Packaging | Hard | 33.5% | 23.7% |
| Trionic Array II | Hard | 47.3% | 23.7% |
| Minimum Stability Factor of Array | Hard | 20.3% | 23.7% |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 22.0% |
| Minimum Cost to Merge Stones | Hard | 45.6% | 22.0% |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 22.0% |
| Find the Median of the Uniqueness Array | Hard | 29.9% | 22.0% |
| Course Schedule III | Hard | 41.4% | 22.0% |
| Guess the Word | Hard | 36.9% | 22.0% |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 22.0% |
| Parallel Courses III | Hard | 66.8% | 20.2% |
| Nth Magical Number | Hard | 36.4% | 20.2% |
| Longest Happy Prefix | Hard | 51.9% | 20.2% |
| Count of Smaller Numbers After Self | Hard | 43.3% | 20.2% |
| Number of Visible People in a Queue | Hard | 72.4% | 20.2% |
| Trips and Users | Hard | 37.7% | 20.2% |
| Find the Minimum Area to Cover All Ones II | Hard | 63.6% | 20.2% |
| Scramble String | Hard | 43.9% | 20.2% |
| Basic Calculator III | Hard | 53.2% | 20.2% |
| Threshold Majority Queries | Hard | 21.7% | 20.2% |
| Total Sum of Interaction Cost in Tree Groups | Hard | 53.5% | 20.2% |
| Minimum Cost to Partition a Binary String | Hard | | 20.2% |
| Number of Atoms | Hard | 65.1% | 18.1% |
| Find the Closest Palindrome | Hard | 31.8% | 18.1% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 18.1% |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 18.1% |
| Maximum Performance of a Team | Hard | 47.7% | 18.1% |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 18.1% |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 18.1% |
| Minimum Cost to Reach Destination in Time | Hard | 41.2% | 18.1% |
| Sliding Window Median | Hard | 38.9% | 18.1% |
| Human Traffic of Stadium | Hard | 50.8% | 18.1% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 18.1% |
| Minimum Cost to Convert String II | Hard | 59.7% | 18.1% |
| Special Binary String | Hard | 79.3% | 18.1% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 18.1% |
| Number of ZigZag Arrays I | Hard | | 15.8% |
| Process String with Special Operations II | Hard | 16.9% | 15.8% |
| Cherry Pickup II | Hard | 72.3% | 15.8% |
| Minimum Initial Energy to Finish Tasks | Hard | 60.7% | 15.8% |
| Jump Game IV | Hard | 46.2% | 15.8% |
| Separate Squares II | Hard | 59.9% | 15.8% |
| Minimum Pair Removal to Sort Array II | Hard | 39.2% | 15.8% |
| Count of Range Sum | Hard | 38.3% | 15.8% |
| Remove Invalid Parentheses | Hard | 49.8% | 15.8% |
| Optimal Account Balancing | Hard | 50.3% | 15.8% |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.7% | 15.8% |
| Shortest Distance from All Buildings | Hard | 44.9% | 15.8% |
| Sum of Prefix Scores of Strings | Hard | 60.8% | 15.8% |
| Set Intersection Size At Least Two | Hard | 57.9% | 15.8% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 15.8% |
| Minimum Cost to Hire K Workers | Hard | 63.6% | 15.8% |
| Contains Duplicate III | Hard | 24.5% | 15.8% |
| Number of Pairs Satisfying Inequality | Hard | 46.8% | 13.3% |
| Rearrange String k Distance Apart | Hard | 39.9% | 13.3% |
| Find the Original Typed String II | Hard | 45.6% | 13.3% |
| Last Day Where You Can Still Cross | Hard | 68.6% | 13.3% |
| Create Maximum Number | Hard | 34.7% | 13.3% |
| Profitable Schemes | Hard | 48.2% | 13.3% |
| Employee Free Time | Hard | 72.8% | 13.3% |
| Strong Password Checker | Hard | 15.5% | 13.3% |
| Maximum Score From Grid Operations | Hard | 27.1% | 10.4% |
| Robot Collisions | Hard | 56.1% | 10.4% |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 10.4% |
| Total Waviness of Numbers in Range II | Hard | | 10.4% |
| Number of Islands II | Hard | 40.4% | 10.4% |
| Minimum Cost Path with Teleportations | Hard | 45.7% | 10.4% |
| Rearranging Fruits | Hard | 57.5% | 10.4% |
| Find Minimum in Rotated Sorted Array II | Hard | 44.7% | 10.4% |
| Count Subarrays With Fixed Bounds | Hard | 69.2% | 10.4% |
| Palindrome Pairs | Hard | 37.0% | 10.4% |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 10.4% |
| Strange Printer | Hard | 60.9% | 10.4% |
| Robot Room Cleaner | Hard | 77.9% | 10.4% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 10.4% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 10.4% |
| Escape the Spreading Fire | Hard | 37.6% | 10.4% |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 10.4% |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 10.4% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.5% | 10.4% |
| Lexicographically Smallest Beautiful String | Hard | 38.1% | 10.4% |
| Count Palindromic Subsequences | Hard | 41.0% | 10.4% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 10.4% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 10.4% |
| Design Excel Sum Formula | Hard | 39.9% | 10.4% |
| Cherry Pickup | Hard | 39.1% | 10.4% |
| Maximum Running Time of N Computers | Hard | 56.4% | 10.4% |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 10.4% |
| Shortest Path Visiting All Nodes | Hard | 65.8% | 10.4% |
| Last Substring in Lexicographical Order | Hard | 35.0% | 10.4% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 10.4% |
| Reaching Points | Hard | 34.2% | 10.4% |
| Best Meeting Point | Hard | 61.4% | 10.4% |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 10.4% |
| Expression Add Operators | Hard | 42.8% | 10.4% |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 10.4% |
| Minimum Operations to Equalize Binary String | Hard | 45.6% | 10.4% |
| Maximize the Minimum Powered City | Hard | 61.8% | 10.4% |
| Parallel Courses II | Hard | 30.6% | 7.2% |
| Jump Game V | Hard | 64.8% | 7.2% |
| Longest Common Suffix Queries | Hard | 35.9% | 7.2% |
| Divide an Array Into Subarrays With Minimum Cost II | Hard | 54.7% | 7.2% |
| Longest Balanced Subarray II | Hard | 33.8% | 7.2% |
| Fancy Sequence | Hard | 18.6% | 7.2% |
| Maximum Walls Destroyed by Robots | Hard | 26.4% | 7.2% |
| XOR After Range Multiplication Queries II | Hard | 37.2% | 7.2% |
| Perfect Rectangle | Hard | 37.3% | 7.2% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 7.2% |
| Find All Possible Stable Binary Arrays II | Hard | 27.6% | 7.2% |
| Merge BSTs to Create Single BST | Hard | 38.0% | 7.2% |
| Range Module | Hard | 44.7% | 7.2% |
| Super Egg Drop | Hard | 29.9% | 7.2% |
| Kth Ancestor of a Tree Node | Hard | 37.2% | 7.2% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 7.2% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 7.2% |
| Dinner Plate Stacks | Hard | 33.5% | 7.2% |
| Minimize Max Distance to Gas Station | Hard | 53.9% | 7.2% |
| Minimum Operations to Make a Subsequence | Hard | 49.6% | 7.2% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 7.2% |
| Data Stream as Disjoint Intervals | Hard | 60.0% | 7.2% |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 7.2% |
| Longest Cycle in a Graph | Hard | 50.5% | 7.2% |
| Analyze Organization Hierarchy | Hard | 59.5% | 7.2% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 7.2% |
| Sliding Puzzle | Hard | 74.2% | 7.2% |
| Count Unique Characters of All Substrings of a Given String | Hard | 53.5% | 7.2% |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 7.2% |
| Remove Boxes | Hard | 49.3% | 7.2% |
| Count the Number of Ideal Arrays | Hard | 56.9% | 7.2% |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% | 7.2% |
| Stream of Characters | Hard | 52.0% | 7.2% |
| Find the K-th Character in String Game II | Hard | 48.5% | 7.2% |
| Maximum Fruits Harvested After at Most K Steps | Hard | 61.0% | 7.2% |
| Patching Array | Hard | 54.1% | 7.2% |
| Longest Path With Different Adjacent Characters | Hard | 54.0% | 7.2% |
| Closest Binary Search Tree Value II | Hard | 61.1% | 7.2% |
| Report Contiguous Dates | Hard | 57.0% | 7.2% |
| Count the Number of Inversions | Hard | 29.7% | 7.2% |
| Escape a Large Maze | Hard | 36.3% | 7.2% |
| Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | 62.3% | 7.2% |
| Minimize Malware Spread | Hard | 43.0% | 7.2% |
| Split Array With Same Average | Hard | 26.8% | 7.2% |
| Distinct Subsequences II | Hard | 44.0% | 7.2% |
| Number of Good Paths | Hard | 56.3% | 7.2% |
| Car Fleet II | Hard | 57.8% | 7.2% |
| Maximize Spanning Tree Stability with Upgrades | Hard | | 7.2% |
| Minimum Cost to Buy Apples II | Hard | | 5.0% |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 5.0% |
| Median Employee Salary | Hard | 65.9% | 5.0% |
| Minimum Deletions to Make Array Divisible | Hard | 60.0% | 5.0% |
| Minimum Cost to Make Array Equal | Hard | 46.7% | 5.0% |
| K-Similar Strings | Hard | 40.6% | 5.0% |
| Sum of Distances in Tree | Hard | 65.5% | 5.0% |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% | 5.0% |
| Split Message Based on Limit | Hard | 42.0% | 5.0% |
| Minimum Cost to Equalize Array | Hard | 18.7% | 5.0% |
| Valid Arrangement of Pairs | Hard | 66.5% | 5.0% |
| Count Different Palindromic Subsequences | Hard | 47.5% | 5.0% |
| Minimum Interval to Include Each Query | Hard | 54.0% | 5.0% |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.3% | 5.0% |
| Random Pick with Blacklist | Hard | 34.6% | 5.0% |
| Manhattan Distances of All Arrangements of Pieces | Hard | 35.1% | 5.0% |
| Maximum Number of K-Divisible Components | Hard | 74.1% | 5.0% |
| Minimum Operations to Make Array Equal to Target | Hard | 41.3% | 5.0% |
| Maximum Strength of K Disjoint Subarrays | Hard | 27.5% | 5.0% |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 5.0% |
| Maximize the Minimum Game Score | Hard | 26.0% | 5.0% |
| Year on Year Growth Rate | Hard | 51.0% | 5.0% |
| Maximum Score of Non-overlapping Intervals | Hard | 31.0% | 5.0% |
| Zuma Game | Hard | 30.2% | 5.0% |
| Tiling a Rectangle with the Fewest Squares | Hard | 54.8% | 5.0% |
| Minimum Amount of Damage Dealt to Bob | Hard | 39.6% | 5.0% |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 5.0% |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 5.0% |
| Minimum Unique Word Abbreviation | Hard | 40.5% | 5.0% |
| Pizza With 3n Slices | Hard | 53.8% | 5.0% |
| Longest Subsequence Repeated k Times | Hard | 71.3% | 5.0% |
| Kth Smallest Instructions | Hard | 44.7% | 5.0% |
| Delete Duplicate Folders in System | Hard | 77.7% | 5.0% |
| Minimize the Maximum Adjacent Element Difference | Hard | 19.4% | 5.0% |
| Maximum Number of Visible Points | Hard | 38.0% | 5.0% |
| Find the Largest Palindrome Divisible by K | Hard | 16.9% | 5.0% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 5.0% |
| Falling Squares | Hard | 47.4% | 5.0% |
| Tallest Billboard | Hard | 51.8% | 5.0% |
| String Compression II | Hard | 52.2% | 5.0% |
| Smallest Good Base | Hard | 45.5% | 5.0% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 5.0% |
| Erect the Fence | Hard | 52.7% | 5.0% |
| Sum of Perfect Square Ancestors | Hard | 42.5% | 5.0% |
| Encrypt and Decrypt Strings | Hard | 38.1% | 5.0% |
| Maximize Cyclic Partition Score | Hard | 12.5% | 5.0% |
| Find All People With Secret | Hard | 48.4% | 5.0% |
| Maximum Building Height | Hard | 38.3% | 5.0% |
| Design Movie Rental System | Hard | 62.6% | 5.0% |
| Number of ZigZag Arrays II | Hard | | 5.0% |
| Similar String Groups | Hard | 56.1% | 5.0% |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% | 5.0% |
| Painting the Walls | Hard | 48.9% | 5.0% |
| Valid Palindrome III | Hard | 49.1% | 5.0% |
| Delete Columns to Make Sorted III | Hard | 72.7% | 5.0% |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 5.0% |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% | 5.0% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 5.0% |
| Word Abbreviation | Hard | 62.7% | 5.0% |
| Lexicographically Smallest Generated String | Hard | 31.5% | 5.0% |
| Final Array State After K Multiplication Operations II | Hard | 13.1% | 5.0% |
| Minimum Total Distance Traveled | Hard | 58.8% | 5.0% |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 5.0% |
| Design Skiplist | Hard | 59.5% | 5.0% |
| Odd Even Jump | Hard | 41.1% | 5.0% |
| Maximum Total Subarray Value II | Hard | | 5.0% |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 5.0% |
| Number of Ways to Assign Edge Weights II | Hard | | 5.0% |
| Number of Unique Good Subsequences | Hard | 52.6% | 5.0% |
| Collect Coins in a Tree | Hard | 39.7% | 5.0% |
