House Robber

Try to solve the House Robber problem.

Statement

As a skilled thief, you are planning to rob multiple houses on a street, each of which contains a substantial amount of money. However, you cannot rob the adjacent houses due to the connected security systems. Otherwise, the police will be contacted automatically.

Given an array of integers, nums, representing the amount of money present in each house, return the maximum amount of money that you can successfully steal without notifying the police.

Constraints

  • 11 \leq nums.length 900\leq 900
  • 00 \leq nums[i] 400\leq 400

Example

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.