| Median of Two Sorted Arrays | Hard | 46.0% | 59.1% |
| Palindrome Partitioning IV | Hard | 45.2% | 55.6% |
| Trapping Rain Water | Hard | 66.8% | 51.3% |
| Burst Balloons | Hard | 63.0% | 48.7% |
| N-Queens | Hard | 75.0% | 45.8% |
| Smallest Sufficient Team | Hard | 55.4% | 45.8% |
| Split Array With Same Average | Hard | 26.8% | 42.3% |
| Sliding Window Maximum | Hard | 48.5% | 38.0% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 38.0% |
| Tallest Billboard | Hard | 51.8% | 38.0% |
| Department Top Three Salaries | Hard | 59.9% | 32.6% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 32.6% |
| Merge k Sorted Lists | Hard | 58.9% | 32.6% |
| First Missing Positive | Hard | 42.5% | 32.6% |
| Maximal Rectangle | Hard | 58.1% | 32.6% |
| Integer to English Words | Hard | 34.8% | 25.2% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 25.2% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 25.2% |
| Regular Expression Matching | Hard | 30.5% | 25.2% |
| Word Ladder | Hard | 44.9% | 25.2% |
| Largest Rectangle in Histogram | Hard | 49.4% | 25.2% |
