Leetcode - House Robber

Question

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Idea

• Basically the same as Leetcode - Min Cost Climbing Stairs except our option is taking the money and doing dp(i+2) or just doing dp(i+1) which we can do using take and skip variables and taking the max of those

Solution