At each house, you have two choices: rob it or skip it. If you rob house i, you can't rob house i-. Your total is nums[i] + maxRob(i-). If you skip house i, your total is maxRob(i-). Take the maximum of these two choices. dp[i] = max(nums[i] + dp[i-], dp[i-])
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/house-robber-hint
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████