| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.3% | 100.0% | Dynamic ProgrammingBit ManipulationTree+2 |
| Minimum Window Substring | Hard | 46.9% | 87.5% | Hash TableStringSliding Window |
| Count Subarrays With Median K | Hard | 47.6% | 75.0% | ArrayHash TablePrefix Sum |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% | 75.0% | ArrayBit ManipulationQueue+2 |
| Interleaving String | Medium | 43.5% | 75.0% | StringDynamic Programming |
| Count Pairs of Connectable Servers in a Weighted Tree Network | Medium | 55.5% | 75.0% | ArrayTreeDepth-First Search |
| House Robber II | Medium | 44.6% | 75.0% | ArrayDynamic Programming |
| Largest Rectangle in Histogram | Hard | 49.3% | 75.0% | ArrayStackMonotonic Stack |