| Trapping Rain Water | Hard | 66.8% | 80.6% |
| Median of Two Sorted Arrays | Hard | 46.0% | 77.3% |
| Number of Ships in a Rectangle | Hard | 68.9% | 64.8% |
| Word Break II | Hard | 55.1% | 63.7% |
| Merge k Sorted Lists | Hard | 58.9% | 58.2% |
| Largest Rectangle in Histogram | Hard | 49.4% | 54.8% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 54.8% |
| Candy | Hard | 48.0% | 54.1% |
| N-Queens | Hard | 75.0% | 54.1% |
| Word Ladder | Hard | 44.9% | 51.3% |
| Regular Expression Matching | Hard | 30.5% | 50.5% |
| Sliding Window Maximum | Hard | 48.5% | 49.7% |
| Wildcard Matching | Hard | 31.4% | 48.0% |
| Reverse Nodes in k-Group | Hard | 65.4% | 47.1% |
| Split Array Largest Sum | Hard | 59.9% | 46.1% |
| Sudoku Solver | Hard | 65.4% | 45.1% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 45.1% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 44.0% |
| Reverse Pairs | Hard | 33.7% | 44.0% |
| Longest Valid Parentheses | Hard | 38.1% | 42.9% |
| Minimum Window Substring | Hard | 47.0% | 41.7% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 40.4% |
| Maximal Rectangle | Hard | 58.1% | 40.4% |
| First Missing Positive | Hard | 42.5% | 40.4% |
| Number of Digit One | Hard | 37.7% | 39.0% |
| Basic Calculator | Hard | 46.6% | 37.5% |
| Find Median from Data Stream | Hard | 54.2% | 37.5% |
| Shortest Palindrome | Hard | 41.9% | 37.5% |
| Find in Mountain Array | Hard | 41.2% | 35.9% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 35.9% |
| Substring with Concatenation of All Words | Hard | 34.0% | 34.1% |
| Allocate Mailboxes | Hard | 56.5% | 34.1% |
| Contain Virus | Hard | 54.4% | 34.1% |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 34.1% |
| Subarrays with K Different Integers | Hard | 67.6% | 32.2% |
| Permutation Sequence | Hard | 52.2% | 32.2% |
| Design Search Autocomplete System | Hard | 49.7% | 32.2% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 30.0% |
| Text Justification | Hard | 50.5% | 27.6% |
| Count of Smaller Numbers After Self | Hard | 43.3% | 27.6% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 27.6% |
| Word Ladder II | Hard | 27.5% | 27.6% |
| Making A Large Island | Hard | 56.3% | 27.6% |
| Distinct Subsequences | Hard | 51.5% | 24.9% |
| Reconstruct Itinerary | Hard | 44.3% | 24.9% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 24.9% |
| Trips and Users | Hard | 37.7% | 24.9% |
| N-Queens II | Hard | 78.2% | 24.9% |
| Critical Connections in a Network | Hard | 59.3% | 24.9% |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 24.9% |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 24.9% |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 24.9% |
| Couples Holding Hands | Hard | 59.2% | 24.9% |
| Bus Routes | Hard | 47.1% | 24.9% |
| IPO | Hard | 53.3% | 21.7% |
| Department Top Three Salaries | Hard | 59.9% | 21.7% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 21.7% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 21.7% |
| Valid Number | Hard | 22.6% | 21.7% |
| Integer to English Words | Hard | 34.8% | 21.7% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 21.7% |
| Expression Add Operators | Hard | 42.8% | 21.7% |
| Total Waviness of Numbers in Range II | Hard | | 18.0% |
| Maximum Building Height | Hard | 38.3% | 18.0% |
| All O`one Data Structure | Hard | 44.2% | 18.0% |
| Guess the Word | Hard | 36.9% | 18.0% |
| Strange Printer | Hard | 60.9% | 18.0% |
| Trapping Rain Water II | Hard | 64.0% | 18.0% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 18.0% |
| Shortest Distance from All Buildings | Hard | 44.9% | 18.0% |
| Binary Tree Cameras | Hard | 47.6% | 18.0% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 18.0% |
| Max Points on a Line | Hard | 30.3% | 18.0% |
| Burst Balloons | Hard | 63.0% | 18.0% |
| Create Maximum Number | Hard | 34.7% | 18.0% |
| Minimum Total Distance Traveled | Hard | 58.8% | 18.0% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 18.0% |
| Contains Duplicate III | Hard | 24.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% |
| Number of ZigZag Arrays II | Hard | | 13.6% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 13.6% |
| Unique Paths III | Hard | 82.8% | 13.6% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 13.6% |
| Parsing A Boolean Expression | Hard | 69.8% | 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% |
| Find the Maximum Number of Fruits Collected | Hard | 65.1% | 13.6% |
| Dungeon Game | Hard | 40.9% | 13.6% |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 13.6% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 13.6% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 13.6% |
| Minimum Operations to Make Array Elements Zero | Hard | 60.4% | 13.6% |
| 24 Game | Hard | 59.3% | 13.6% |
| Word Search II | Hard | 38.1% | 13.6% |
| LFU Cache | Hard | 48.6% | 13.6% |
| Maximum Frequency Stack | Hard | 66.6% | 13.6% |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 13.6% |
| Find the K-th Character in String Game II | Hard | 48.5% | 13.6% |
| Super Egg Drop | Hard | 29.9% | 13.6% |
| Special Binary String | Hard | 79.3% | 13.6% |
| Fancy Sequence | Hard | 18.6% | 8.4% |
| Alien Dictionary | Hard | 37.1% | 8.4% |
| Palindrome Partitioning II | Hard | 36.6% | 8.4% |
| Longest Duplicate Substring | Hard | 31.1% | 8.4% |
| Sum of Prefix Scores of Strings | Hard | 60.8% | 8.4% |
| Number of Visible People in a Queue | Hard | 72.4% | 8.4% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 8.4% |
| Sliding Window Median | Hard | 38.9% | 8.4% |
| Longest Happy Prefix | Hard | 51.9% | 8.4% |
| Count Good Triplets in an Array | Hard | 65.8% | 8.4% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 8.4% |
| Maximum Sum of Edge Values in a Graph | Hard | 35.7% | 8.4% |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 8.4% |
| Scramble String | Hard | 43.9% | 8.4% |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 8.4% |
| Minimum Moves to Reach Target in Grid | Hard | 14.9% | 8.4% |
| Student Attendance Record II | Hard | 56.4% | 8.4% |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 8.4% |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 8.4% |
| Sum of k-Mirror Numbers | Hard | 63.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% |
| Orderly Queue | Hard | 66.7% | 8.4% |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 8.4% |
| Rearranging Fruits | Hard | 57.5% | 8.4% |
| Delete Duplicate Folders in System | Hard | 77.7% | 8.4% |
| Minimum Interval to Include Each Query | Hard | 54.0% | 8.4% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 8.4% |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 8.4% |
| Tiling a Rectangle with the Fewest Squares | Hard | 54.8% | 8.4% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 8.4% |
| Frog Jump | Hard | 47.1% | 8.4% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 8.4% |
| Find X-Sum of All K-Long Subarrays II | Hard | 41.1% | 8.4% |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 8.4% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 8.4% |
| Russian Doll Envelopes | Hard | 37.7% | 8.4% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 8.4% |
| The Skyline Problem | Hard | 45.0% | 8.4% |
| Put Marbles in Bags | Hard | 72.2% | 8.4% |
| Maximum Running Time of N Computers | Hard | 56.4% | 8.4% |
| Employee Free Time | Hard | 72.8% | 8.4% |
| Number of Ways to Divide a Long Corridor | Hard | 54.6% | 8.4% |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 8.4% |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% | 8.4% |
| Meeting Rooms III | Hard | 51.6% | 8.4% |
| Number of Good Paths | Hard | 56.3% | 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% |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 8.4% |
| Trionic Array II | Hard | 47.3% | 8.4% |
| Self Crossing | Hard | 34.2% | 8.4% |
| Remove Invalid Parentheses | Hard | 49.8% | 8.4% |
| Find the Closest Palindrome | Hard | 31.8% | 8.4% |
| Human Traffic of Stadium | Hard | 50.8% | 8.4% |
| Shortest Common Supersequence | Hard | 61.8% | 8.4% |
| Maximize the Distance Between Points on a Square | Hard | | 8.4% |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 8.4% |
