LeetCode 198 House Robber - Problem Statement

Houses along a street have money. You can't rob two adjacent houses (security systems will trigger). What's the maximum you can rob?

With nums = [1,2,3,1]:

• Rob house 0 ($1$) and house 2 ($3$): total $4$.
• Can't rob 1 and 2 together (adjacent).
• Maximum: $4$.

With nums = [2,7,9,3,1]:

• Rob houses 0, 2, 4: $2 + 9 + 1 = 12$.
• Or rob houses 1, 3: $7 + 3 = 10$.
• Maximum: $12$.

Constraints: $1 \le$ nums.length $\le 100$.