| 189. Rotate ArrayOpen source | Medium | ArrayMathTwo Pointers |
| 190. Reverse BitsOpen source | Easy | Divide and ConquerBit Manipulation |
| 191. Number of 1 BitsOpen source | Easy | Divide and ConquerBit Manipulation |
| 198. House RobberOpen source | Medium | ArrayDynamic Programming |
| 199. Binary Tree Right Side ViewOpen source | Medium | TreeDepth-First SearchBreadth-First Search+1 more |
| 200. Number of IslandsOpen source | Medium | ArrayDepth-First SearchBreadth-First Search+2 more |
| 201. Bitwise AND of Numbers RangeOpen source | Medium | Bit Manipulation |
| 202. Happy NumberOpen source | Easy | Hash TableMathTwo Pointers+1 more |
| 206. Reverse Linked ListOpen source | Easy | Linked ListRecursion |
| 207. Course ScheduleOpen source | Medium | Depth-First SearchBreadth-First SearchGraph Theory+2 more |
| 208. Implement Trie (Prefix Tree)Open source | Medium | Hash TableStringDesign+1 more |
| 209. Minimum Size Subarray SumOpen source | Medium | ArrayBinary SearchSliding Window+1 more |
| 210. Course Schedule IIOpen source | Medium | Depth-First SearchBreadth-First SearchGraph Theory+1 more |
| 211. Design Add and Search Words Data StructureOpen source | Medium | StringDepth-First SearchDesign+1 more |
| 212. Word Search IIOpen source | Hard | ArrayStringBacktracking+2 more |
| 213. House Robber IIOpen source | Medium | ArrayDynamic Programming |
| 215. Kth Largest Element in an ArrayOpen source | Medium | ArrayDivide and ConquerSorting+2 more |
| 217. Contains DuplicateOpen source | Easy | ArrayHash TableSorting |
| 219. Contains Duplicate IIOpen source | Easy | ArrayHash TableSliding Window |
| 225. Implement Stack using QueuesOpen source | Easy | StackDesignQueue |
| 226. Invert Binary TreeOpen source | Easy | TreeDepth-First SearchBreadth-First Search+1 more |
| 229. Majority Element IIOpen source | Medium | ArrayHash TableSorting+2 more |
| 230. Kth Smallest Element in a BSTOpen source | Medium | TreeDepth-First SearchBinary Search Tree+1 more |
| 232. Implement Queue using StacksOpen source | Easy | StackDesignQueue |
| 235. Lowest Common Ancestor of a Binary Search TreeOpen source | Medium | TreeDepth-First SearchBinary Search Tree+3 more |