| Sliding Window Maximum | Hard | 48.5% | 76.1% |
| Merge k Sorted Lists | Hard | 58.9% | 73.3% |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 67.6% |
| LFU Cache | Hard | 48.6% | 66.2% |
| Trapping Rain Water | Hard | 66.8% | 61.5% |
| Maximize Value of Function in a Ball Passing Game | Hard | 30.4% | 59.7% |
| Count the Number of Houses at a Certain Distance II | Hard | 23.7% | 57.7% |
| Find Median from Data Stream | Hard | 54.2% | 55.5% |
| Median of Two Sorted Arrays | Hard | 46.0% | 55.5% |
| First Missing Positive | Hard | 42.5% | 53.1% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.3% |
| Count the Number of Infection Sequences | Hard | 37.2% | 50.3% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 50.3% |
| Word Ladder | Hard | 44.9% | 50.3% |
| Minimum Window Substring | Hard | 47.0% | 47.1% |
| Word Break II | Hard | 55.1% | 47.1% |
| Design In-Memory File System | Hard | 48.4% | 47.1% |
| N-Queens | Hard | 75.0% | 47.1% |
| Number of Visible People in a Queue | Hard | 72.4% | 43.3% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 43.3% |
| Consecutive Numbers Sum | Hard | 42.6% | 43.3% |
| Maximum Good People Based on Statements | Hard | 52.3% | 38.7% |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 38.7% |
| Distance to a Cycle in Undirected Graph | Hard | 74.0% | 32.9% |
| Basic Calculator | Hard | 46.6% | 32.9% |
| Integer to English Words | Hard | 34.8% | 32.9% |
| Rearranging Fruits | Hard | 57.5% | 32.9% |
| Distinct Subsequences | Hard | 51.5% | 32.9% |
| Regular Expression Matching | Hard | 30.5% | 32.9% |
| Minimum Cost to Make Array Equal | Hard | 46.7% | 32.9% |
| Candy | Hard | 48.0% | 32.9% |
| Frog Jump | Hard | 47.1% | 32.9% |
| Meeting Rooms III | Hard | 51.6% | 32.9% |
| Number of Music Playlists | Hard | 60.0% | 32.9% |
| Text Justification | Hard | 50.5% | 24.9% |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 24.9% |
| Max Stack | Hard | 45.9% | 24.9% |
| Split Array Largest Sum | Hard | 59.9% | 24.9% |
| Count of Range Sum | Hard | 38.3% | 24.9% |
| Basic Calculator III | Hard | 53.2% | 24.9% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 24.9% |
| Create Maximum Number | Hard | 34.7% | 24.9% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 24.9% |
| Word Search II | Hard | 38.1% | 24.9% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 24.9% |
| Collect Coins in a Tree | Hard | 39.7% | 24.9% |
| Subarrays with K Different Integers | Hard | 67.6% | 24.9% |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.7% | 24.9% |
| Trapping Rain Water II | Hard | 64.0% | 24.9% |
| Find in Mountain Array | Hard | 41.2% | 24.9% |
| Largest Rectangle in Histogram | Hard | 49.4% | 24.9% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 24.9% |
| Wildcard Matching | Hard | 31.4% | 24.9% |
| Sudoku Solver | Hard | 65.4% | 24.9% |
| Remove Invalid Parentheses | Hard | 49.8% | 24.9% |
| Longest Valid Parentheses | Hard | 38.1% | 24.9% |
| Bus Routes | Hard | 47.1% | 24.9% |
| Reverse Nodes in k-Group | Hard | 65.4% | 24.9% |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 24.9% |
