Problem
Maximize the amount stolen without robbing adjacent houses.
Example 1
Input: nums = [2,7,9,3,1]
Output: 12
Constraints
- 1 <= nums.length <= 100
Notes
- Focus on the underlying dynamic programming pattern.
- Write the cleanest correct solution before optimizing further.
- Hidden tests cover larger edge cases than the visible examples.