Skip to content

problem3.md

Latest commit

 

History

History
16 lines (12 loc) · 741 Bytes

problem3.md

File metadata and controls

16 lines (12 loc) · 741 Bytes

Problem 3: The Treasure Heist (House Robber)

Problem Statement

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. Adjacent houses have security systems connected — if two adjacent houses are broken into on the same night, the police will be alerted. 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.

Input Format

  • An array of non-negative integers nums.

Constraints

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400

Example

Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (2) + house 3 (9) + house 5 (1) = 12.