| 53. Maximum SubarrayOpen source | Medium | ArrayDivide and ConquerDynamic Programming |
| 54. Spiral MatrixOpen source | Medium | ArrayMatrixSimulation |
| 55. Jump GameOpen source | Medium | ArrayDynamic ProgrammingGreedy |
| 56. Merge IntervalsOpen source | Medium | ArraySortingQuicksort |
| 57. Insert IntervalOpen source | Medium | Array |
| 59. Spiral Matrix IIOpen source | Medium | ArrayMatrixSimulation |
| 63. Unique Paths IIOpen source | Medium | ArrayDynamic ProgrammingMatrix |
| 64. Minimum Path SumOpen source | Medium | ArrayDynamic ProgrammingMatrix |
| 66. Plus OneOpen source | Easy | ArrayMath |
| 68. Text JustificationOpen source | Hard | ArrayStringSimulation |
| 73. Set Matrix ZeroesOpen source | Medium | ArrayHash TableMatrix |
| 74. Search a 2D MatrixOpen source | Medium | ArrayBinary SearchMatrix |
| 75. Sort ColorsOpen source | Medium | ArrayTwo PointersSorting+2 more |
| 78. SubsetsOpen source | Medium | ArrayBacktrackingBit Manipulation |
| 79. Word SearchOpen source | Medium | ArrayStringBacktracking+2 more |
| 80. Remove Duplicates from Sorted Array IIOpen source | Medium | ArrayTwo Pointers |
| 81. Search in Rotated Sorted Array IIOpen source | Medium | ArrayBinary Search |
| 84. Largest Rectangle in HistogramOpen source | Hard | ArrayStackMonotonic Stack+1 more |
| 85. Maximal RectangleOpen source | Hard | ArrayDynamic ProgrammingStack+2 more |
| 88. Merge Sorted ArrayOpen source | Easy | ArrayTwo PointersSorting |
| 90. Subsets IIOpen source | Medium | ArrayBacktrackingBit Manipulation |
| 105. Construct Binary Tree from Preorder and Inorder TraversalOpen source | Medium | ArrayHash TableDivide and Conquer+2 more |
| 106. Construct Binary Tree from Inorder and Postorder TraversalOpen source | Medium | ArrayHash TableDivide and Conquer+2 more |
| 108. Convert Sorted Array to Binary Search TreeOpen source | Easy | ArrayDivide and ConquerTree+2 more |
| 118. Pascal's TriangleOpen source | Easy | ArrayDynamic Programming |