| 49. Group AnagramsOpen source | Medium | ArrayHash TableString+1 more |
| 50. Pow(x, n)Open source | Medium | MathRecursion |
| 51. N-QueensOpen source | Hard | ArrayBacktrackingAlgorithm X |
| 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 |
| 62. Unique PathsOpen source | Medium | MathDynamic ProgrammingCombinatorics |
| 66. Plus OneOpen source | Easy | ArrayMath |
| 70. Climbing StairsOpen source | Easy | MathDynamic ProgrammingMemoization |
| 72. Edit DistanceOpen source | Medium | StringDynamic Programming |
| 73. Set Matrix ZeroesOpen source | Medium | ArrayHash TableMatrix |
| 74. Search a 2D MatrixOpen source | Medium | ArrayBinary SearchMatrix |
| 76. Minimum Window SubstringOpen source | Hard | Hash TableStringSliding Window |
| 78. SubsetsOpen source | Medium | ArrayBacktrackingBit Manipulation |
| 79. Word SearchOpen source | Medium | ArrayStringBacktracking+2 more |
| 84. Largest Rectangle in HistogramOpen source | Hard | ArrayStackMonotonic Stack+1 more |
| 90. Subsets IIOpen source | Medium | ArrayBacktrackingBit Manipulation |
| 91. Decode WaysOpen source | Medium | StringDynamic Programming |
| 97. Interleaving StringOpen source | Medium | StringDynamic Programming |
| 98. Validate Binary Search TreeOpen source | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 100. Same TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 102. Binary Tree Level Order TraversalOpen source | Medium | TreeBreadth-First SearchBinary Tree |
| 104. Maximum Depth of Binary TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |