| Maximum Good Subtree Score | Hard | 45.5% | 100.0% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 94.9% |
| Minimum Reverse Operations | Hard | 16.7% | 93.0% |
| Count the Number of Ideal Arrays | Hard | 56.9% | 90.9% |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% | 88.6% |
| Maximize the Minimum Game Score | Hard | 26.0% | 86.1% |
| Find the Number of Subsequences With Equal GCD | Hard | 31.5% | 86.1% |
| Minimum Total Distance Traveled | Hard | 58.8% | 86.1% |
| Maximum Segment Sum After Removals | Hard | 49.3% | 86.1% |
| Number of Beautiful Integers in the Range | Hard | 21.6% | 86.1% |
| Stone Game VIII | Hard | 53.9% | 86.1% |
| Trapping Rain Water | Hard | 66.8% | 67.9% |
| Reverse Nodes in k-Group | Hard | 65.4% | 54.6% |
| Median of Two Sorted Arrays | Hard | 46.0% | 44.3% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 44.3% |
| Minimum Window Substring | Hard | 47.0% | 44.3% |
