| Binary Tree Maximum Path Sum | Hard | 42.0% | 100.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 100.0% | Hash TableStringDivide and Conquer+1 |
| Integer Replacement | Medium | 37.1% | 100.0% | Dynamic ProgrammingGreedyBit Manipulation+1 |
| Split Array Largest Sum | Hard | 59.8% | 100.0% | ArrayBinary SearchDynamic Programming+2 |
| Arithmetic Slices | Medium | 64.8% | 100.0% | ArrayDynamic ProgrammingSliding Window |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 100.0% | ArrayDynamic Programming |
| Zuma Game | Hard | 30.2% | 100.0% | StringDynamic ProgrammingStack+2 |
| Out of Boundary Paths | Medium | 48.4% | 100.0% | Dynamic Programming |
| Design In-Memory File System | Hard | 48.4% | 100.0% | |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 100.0% | ArrayHash TableDynamic Programming |
| Search a 2D Matrix II | Medium | 56.8% | 62.5% | ArrayBinary SearchDivide and Conquer+1 |