House Robber
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.
Example 1:
Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). Total = 1 + 3 = 4.
Example 2:
Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). Total = 2 + 9 + 1 = 12.
Example 3:
Input: nums = [2,1,1,2]
Output: 4
Explanation: Rob house 1 (money = 2) and house 4 (money = 2). Total = 2 + 2 = 4.
Examples
Example 1
Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob houses at index 0 and 2 for a total of 1 + 3 = 4. Robbing houses 1 and 3 gives only 2 + 1 = 3.
Example 2
Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob houses at index 0, 2, and 4 for a total of 2 + 9 + 1 = 12. This is better than 7 + 3 = 10.
Constraints
- -1 <= nums.length <= 100
- -0 <= nums[i] <= 400
Optimal Complexity
Time
O(n)
Space
O(1)
Practice this problem with an AI interviewer
TechInView conducts a full voice mock interview — the AI asks clarifying questions, evaluates your approach, watches you code, and scores you on 5 dimensions. Just like a real FAANG interview.
Start a free interview