Practice House Robber
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: House Robber on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [1,2,3,1]
4
# Example 2
nums = [2,7,9,3,1]
12
Constraints
Related LeetCode Problems
Practice more problems similar to House Robber.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.