| Find Edges in Shortest Paths | Hard | 46.4% | 100.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Maximize Greatness of an Array | Medium | 61.3% | 84.8% | ArrayTwo PointersGreedy+1 |
| Detect Cycles in 2D Grid | Medium | 52.5% | 73.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 73.6% | ArrayBinary SearchDynamic Programming+1 |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 73.6% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Swim in Rising Water | Hard | 67.6% | 73.6% | ArrayBinary SearchDepth-First Search+4 |
| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.4% | 73.6% | Hash TableBit ManipulationTree+1 |
| Text Justification | Hard | 50.5% | 64.8% | ArrayStringSimulation |
| Design Snake Game | Medium | 40.0% | 64.8% | ArrayHash TableDesign+2 |
| Count Binary Substrings | Easy | 70.3% | 64.8% | Two PointersString |