dsa · medium

House Robber

GreyOrangeDynamic Programming

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. Return the maximum amount of money you can rob tonight without alerting the police.

Arguments

• nums — the input array of integers

**Example 1:** `` Input: nums = [1,2,3,1] Output: 4 ``

Constraints

1 <= nums.length <= 100 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.

Examples

Example 1

Input:
[1,2,3,1]

Expected:
4

Example 2

Input:
[2,7,9,3,1]

Expected:
12

Open in the Dojo editor