| Maximum Frequency Score of a Subarray | Hard | 36.5% | 79.1% |
| Paint House III | Hard | 61.2% | 76.9% |
| Number of Valid Move Combinations On Chessboard | Hard | 48.8% | 76.9% |
| Count Array Pairs Divisible by K | Hard | 30.6% | 76.9% |
| Find Median from Data Stream | Hard | 54.2% | 65.0% |
| Reaching Points | Hard | 34.2% | 49.0% |
| LFU Cache | Hard | 48.6% | 49.0% |
| Trapping Rain Water | Hard | 66.8% | 49.0% |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 39.7% |
| Text Justification | Hard | 50.5% | 39.7% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 39.7% |
| Median of Two Sorted Arrays | Hard | 46.0% | 39.7% |
| First Missing Positive | Hard | 42.5% | 39.7% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 39.7% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 39.7% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 39.7% |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 39.7% |
