LeetCode 198 House Robber - Final Answer

$3.$ Determine the final answer

You process all values from $2$ up to $n$ using the formula $dp[i] = \max\bigl(dp[i - 1],\ dp[i - 2] + \text{a}[i]\bigr), \quad \text{for } i = 2, 3, \dots, n.$ The final answer to the problem is simply $dp[n].$ This dynamic programming solution runs in $O(n)$ time and uses $O(n)$ space, and it uses $O(n)$ memory.**

The structure is exactly the same: define the state (what each dp[i] represents), find the transition, set the base cases, and read the final answer from the appropriate $dp$ state.