| Parallel Courses III | Hard | 66.8% | 92.8% |
| Design In-Memory File System | Hard | 48.4% | 92.8% |
| Minimum Window Substring | Hard | 47.0% | 90.9% |
| Word Search II | Hard | 38.1% | 89.8% |
| Trapping Rain Water | Hard | 66.8% | 86.4% |
| Painting the Walls | Hard | 48.9% | 85.1% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 79.1% |
| String Transformation | Hard | 26.7% | 75.3% |
| Find the Maximum Length of a Good Subsequence II | Hard | 25.1% | 73.2% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 70.8% |
| Merge k Sorted Lists | Hard | 58.9% | 70.8% |
| Basic Calculator | Hard | 46.6% | 61.7% |
| Regular Expression Matching | Hard | 30.5% | 52.7% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 52.7% |
| Making A Large Island | Hard | 56.3% | 46.3% |
| Integer to English Words | Hard | 34.8% | 46.3% |
| Parallel Courses II | Hard | 30.6% | 46.3% |
| Find Median from Data Stream | Hard | 54.2% | 37.4% |
| N-Queens II | Hard | 78.2% | 37.4% |
| Height of Binary Tree After Subtree Removal Queries | Hard | 54.9% | 37.4% |
