| Cycle Length Queries in a Tree | Hard | 60.1% | 100.0% | ArrayTreeBinary Tree |
| Maximize the Confusion of an Exam | Medium | 69.7% | 100.0% | StringBinary SearchSliding Window+1 |
| Maximum Length of Subarray With Positive Product | Medium | 44.6% | 100.0% | ArrayDynamic ProgrammingGreedy |
| Count Collisions on a Road | Medium | 58.1% | 100.0% | StringStackSimulation |
| Number of People Aware of a Secret | Medium | 60.9% | 100.0% | Dynamic ProgrammingQueueSimulation |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 100.0% | ArrayTwo PointersBinary Search+5 |
| House Robber IV | Medium | 64.8% | 87.5% | ArrayBinary SearchDynamic Programming+1 |
| House Robber | Medium | 52.9% | 62.5% | ArrayDynamic Programming |
| Edit Distance | Medium | 60.1% | 62.5% | StringDynamic Programming |
| Find the Count of Monotonic Pairs I | Hard | 47.5% | 62.5% | ArrayMathDynamic Programming+2 |
| Next Permutation | Medium | 44.7% | 62.5% | ArrayTwo Pointers |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 62.5% | ArraySliding Window |
| Maximal Rectangle | Hard | 58.1% | 62.5% | ArrayDynamic ProgrammingStack+2 |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Median of Two Sorted Arrays | Hard | 45.9% | 62.5% | ArrayBinary SearchDivide and Conquer |
| Word Ladder | Hard | 44.9% | 62.5% | Hash TableStringBreadth-First Search |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |