Problem 61 of 75

House Robber

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

You cannot rob two adjacent houses. Given an array nums of money in each house, return the maximum amount you can rob tonight without alerting the police.

[1,2,3,1] → 4 [2,7,9,3,1] → 12

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

House Robber, explainedNeetCode