| Burst Balloons | Hard | 63.0% | 98.0% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 95.9% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 93.7% |
| Minimize Deviation in Array | Hard | 54.0% | 93.7% |
| Number of Paths with Max Score | Hard | 42.1% | 93.7% |
| Count Prefix and Suffix Pairs II | Hard | 28.1% | 91.1% |
| Substring with Concatenation of All Words | Hard | 34.0% | 91.1% |
| Minimum Number of Operations to Make String Sorted | Hard | 50.7% | 91.1% |
| Design Graph With Shortest Path Calculator | Hard | 64.9% | 91.1% |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 91.1% |
| Trapping Rain Water | Hard | 66.8% | 88.4% |
| Merge k Sorted Lists | Hard | 58.9% | 59.6% |
| Word Ladder | Hard | 44.9% | 49.1% |
| Trapping Rain Water II | Hard | 64.0% | 49.1% |
| Split Array Largest Sum | Hard | 59.9% | 49.1% |
| IPO | Hard | 53.3% | 49.1% |
| Median of Two Sorted Arrays | Hard | 46.0% | 49.1% |
