Leetcode 198. House Robber

Given an array of nonnegative integers representing house values, find the maximum sum you can obtain by selecting houses with the constraint that no two chosen houses are adjacent — a classic dynamic programming problem of deciding at each index whether to rob it or skip it to maximize total.