Search⌘ K
AI Features

House Robber

Explore how to solve the House Robber problem, where you maximize the amount stolen from houses without robbing adjacent ones. Learn to implement an optimal solution with O(n) time and O(1) space complexity, enhancing your coding interview skills.

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
...