| 1 | Two Sum | — | Easy | ArrayHash Table | 56% | |
| 4 | Median of Two Sorted Arrays | — | Hard | ArrayBinary SearchDivide and Conquer | 44% | |
| 11 | Container With Most Water | — | Medium | ArrayTwo PointersGreedy | 58% | |
| 15 | 3Sum | — | Medium | ArrayTwo PointersSorting | 37% | |
| 16 | 3Sum Closest | — | Medium | ArrayTwo PointersSorting | 47% | |
| 18 | 4Sum | — | Medium | ArrayTwo PointersSorting | 38% | |
| 26 | Remove Duplicates from Sorted Array | — | Easy | ArrayTwo Pointers | 60% | |
| 27 | Remove Element | — | Easy | ArrayTwo Pointers | 60% | |
| 31 | Next Permutation | — | Medium | ArrayTwo Pointers | 43% | |
| 33 | Search in Rotated Sorted Array | — | Medium | ArrayBinary Search | 43% | |
| 34 | Find First and Last Position of Element in Sorted Array | — | Medium | ArrayBinary Search | 47% | |
| 35 | Search Insert Position | — | Easy | ArrayBinary Search | 49% | |
| 36 | Valid Sudoku | — | Medium | ArrayHash TableMatrix | 62% | |
| 37 | Sudoku Solver | — | Hard | ArrayHash TableBacktracking | 64% | |
| 39 | Combination Sum | — | Medium | ArrayBacktracking | 74% | |
| 40 | Combination Sum II | — | Medium | ArrayBacktracking | 58% | |
| 41 | First Missing Positive | — | Hard | ArrayHash Table | 41% | |
| 42 | Trapping Rain Water | — | Hard | ArrayTwo PointersDynamic Programming | 65% | |
| 45 | Jump Game II | — | Medium | ArrayDynamic ProgrammingGreedy | 41% | |
| 46 | Permutations | — | Medium | ArrayBacktracking | 81% | |
| 47 | Permutations II | — | Medium | ArrayBacktrackingSorting | 61% | |
| 48 | Rotate Image | — | Medium | ArrayMathMatrix | 78% | |
| 49 | Group Anagrams | — | Medium | ArrayHash TableString | 71% | |
| 51 | N-Queens | — | Hard | ArrayBacktracking | 72% | |
| 53 | Maximum Subarray | — | Medium | ArrayDivide and ConquerDynamic Programming | 52% | |
| 54 | Spiral Matrix | — | Medium | ArrayMatrixSimulation | 54% | |
| 55 | Jump Game | — | Medium | ArrayDynamic ProgrammingGreedy | 39% | |
| 56 | Merge Intervals | — | Medium | ArraySorting | 49% | |
| 57 | Insert Interval | — | Medium | Array | 43% | |
| 59 | Spiral Matrix II | — | Medium | ArrayMatrixSimulation | 73% | |
| 63 | Unique Paths II | — | Medium | ArrayDynamic ProgrammingMatrix | 43% | |
| 64 | Minimum Path Sum | — | Medium | ArrayDynamic ProgrammingMatrix | 66% | |
| 66 | Plus One | — | Easy | ArrayMath | 47% | |
| 68 | Text Justification | — | Hard | ArrayStringSimulation | 48% | |
| 73 | Set Matrix Zeroes | — | Medium | ArrayHash TableMatrix | 60% | |
| 74 | Search a 2D Matrix | — | Medium | ArrayBinary SearchMatrix | 52% | |
| 75 | Sort Colors | — | Medium | ArrayTwo PointersSorting | 67% | |
| 78 | Subsets | — | Medium | ArrayBacktrackingBit Manipulation | 81% | |
| 79 | Word Search | — | Medium | ArrayStringBacktracking | 45% | |
| 80 | Remove Duplicates from Sorted Array II | — | Medium | ArrayTwo Pointers | 63% | |
| 81 | Search in Rotated Sorted Array II | — | Medium | ArrayBinary Search | 39% | |
| 84 | Largest Rectangle in Histogram | — | Hard | ArrayStackMonotonic Stack | 47% | |
| 85 | Maximal Rectangle | — | Hard | ArrayDynamic ProgrammingStack | 53% | |
| 88 | Merge Sorted Array | — | Easy | ArrayTwo PointersSorting | 53% | |
| 90 | Subsets II | — | Medium | ArrayBacktrackingBit Manipulation | 59% | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | — | Medium | ArrayHash TableDivide and Conquer | 67% | |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | — | Medium | ArrayHash TableDivide and Conquer | 66% | |
| 108 | Convert Sorted Array to Binary Search Tree | — | Easy | ArrayDivide and ConquerTree | 74% | |
| 118 | Pascal's Triangle | — | Easy | ArrayDynamic Programming | 77% | |
| 119 | Pascal's Triangle II | — | Easy | ArrayDynamic Programming | 66% | |