| Trapping Rain Water | Hard | 66.8% | 90.6% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 85.7% |
| Count Good Triplets in an Array | Hard | 65.8% | 85.7% |
| Number of Ways to Separate Numbers | Hard | 21.6% | 85.7% |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 85.7% |
| Max Stack | Hard | 45.9% | 72.1% |
| LFU Cache | Hard | 48.6% | 67.2% |
| Median of Two Sorted Arrays | Hard | 46.0% | 67.2% |
| Find Median from Data Stream | Hard | 54.2% | 67.2% |
| Merge k Sorted Lists | Hard | 58.9% | 61.2% |
| Reverse Nodes in k-Group | Hard | 65.4% | 61.2% |
| Trapping Rain Water II | Hard | 64.0% | 61.2% |
| First Missing Positive | Hard | 42.5% | 53.6% |
| Minimum Window Substring | Hard | 47.0% | 53.6% |
| Wildcard Matching | Hard | 31.4% | 53.6% |
| Largest Rectangle in Histogram | Hard | 49.4% | 53.6% |
| Sliding Window Maximum | Hard | 48.5% | 43.0% |
| Count Different Palindromic Subsequences | Hard | 47.5% | 43.0% |
| Number of Islands II | Hard | 40.4% | 43.0% |
| N-Queens II | Hard | 78.2% | 43.0% |
| Reconstruct Itinerary | Hard | 44.3% | 43.0% |
| Meeting Rooms III | Hard | 51.6% | 43.0% |
| Candy | Hard | 48.0% | 43.0% |
| Bus Routes | Hard | 47.1% | 43.0% |
| Basic Calculator | Hard | 46.6% | 43.0% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 43.0% |
