| 52 | N-Queens II | Hard | 1843 | backtracking |
| 53 | Maximum Subarray | Medium | 1409 | arraydynamic-programmingdivide-and-conquer |
| 54 | Spiral Matrix | Medium | 1524 | arraymatrixsimulation |
| 55 | Jump Game | Medium | 1565 | arraydynamic-programminggreedy |
| 56 | Merge Intervals | Medium | 1551 | arraysorting |
| 57 | Insert Interval | Medium | 1541 | array |
| 58 | Length of Last Word | Easy | 1156 | string |
| 59 | Spiral Matrix II | Medium | — | arraymatrixsimulation |
| 60 | Permutation Sequence | Hard | 1953 | mathrecursion |
| 61 | Rotate List | Medium | 1558 | linked-listtwo-pointers |
| 62 | Unique Paths | Medium | 1383 | mathdynamic-programmingcombinatorics |
| 63 | Unique Paths II | Medium | 1400 | arraydynamic-programmingmatrix |
| 64 | Minimum Path Sum | Medium | 1444 | arraydynamic-programmingmatrix |
| 65 | Valid Number | Hard | 1892 | string |
| 66 | Plus One | Easy | 1151 | arraymath |
| 67 | Add Binary | Easy | 1160 | mathstringbit-manipulation+1 |
| 68 | Text Justification | Hard | 1657 | arraystringsimulation |
| 69 | Sqrt(x) | Easy | 1178 | mathbinary-search |
| 70 | Climbing Stairs | Easy | 1232 | mathdynamic-programmingmemoization |
| 71 | Simplify Path | Medium | 1532 | stringstack |
| 72 | Edit Distance | Medium | 1703 | stringdynamic-programming |
| 73 | Set Matrix Zeroes | Medium | 1390 | arrayhash-tablematrix |
| 74 | Search a 2D Matrix | Medium | 1478 | arraybinary-searchmatrix |
| 75 | Sort Colors | Medium | 1381 | arraytwo-pointerssorting |
| 76 | Minimum Window Substring | Hard | 1890 | hash-tablestringsliding-window |
| 77 | Combinations | Medium | 1483 | backtracking |
| 78 | Subsets | Medium | 1416 | arraybacktrackingbit-manipulation |
| 79 | Word Search | Medium | 1700 | arraystringbacktracking+1 |
| 80 | Remove Duplicates from Sorted Array II | Medium | 1381 | arraytwo-pointers |
| 81 | Search in Rotated Sorted Array II | Medium | — | arraybinary-search |
| 82 | Remove Duplicates from Sorted List II | Medium | 1509 | linked-listtwo-pointers |
| 83 | Remove Duplicates from Sorted List | Easy | 1169 | linked-list |
| 84 | Largest Rectangle in Histogram | Hard | 1949 | arraystackmonotonic-stack |
| 85 | Maximal Rectangle | Hard | 2188 | arraydynamic-programmingstack+2 |
| 86 | Partition List | Medium | 1519 | linked-listtwo-pointers |
| 87 | Scramble String | Hard | 2264 | stringdynamic-programming |
| 88 | Merge Sorted Array | Easy | 1165 | arraytwo-pointerssorting |
| 90 | Subsets II | Medium | 1517 | arraybacktrackingbit-manipulation |
| 91 | Decode Ways | Medium | 1635 | stringdynamic-programming |
| 92 | Reverse Linked List II | Medium | 1559 | linked-list |
| 93 | Restore IP Addresses | Medium | 1627 | backtrackingstring |
| 94 | Binary Tree Inorder Traversal | Easy | 1250 | stacktreedepth-first-search+1 |
| 95 | Unique Binary Search Trees II | Medium | — | dynamic-programmingbacktrackingtree+2 |
| 96 | Unique Binary Search Trees | Medium | — | mathdynamic-programmingtree+2 |
| 97 | Interleaving String | Medium | 1785 | stringdynamic-programming |
| 98 | Validate Binary Search Tree | Medium | 1490 | treedepth-first-searchbinary-search-tree+1 |
| 99 | Recover Binary Search Tree | Medium | — | treedepth-first-searchbinary-search-tree+1 |
| 100 | Same Tree | Easy | 1176 | treedepth-first-searchbreadth-first-search+1 |
| 101 | Symmetric Tree | Easy | 1200 | treedepth-first-searchbreadth-first-search+1 |
| 102 | Binary Tree Level Order Traversal | Medium | 1308 | treebreadth-first-searchbinary-tree |