Solution: House Robber II
Learn to solve the House Robber II problem where houses are arranged in a circle and adjacent houses cannot both be robbed. This lesson guides you through an optimized dynamic programming solution that uses tabulation and space-efficient techniques to find the maximum robbery amount without alerting the police, improving on naive methods through iterative computation and problem subdivision.
Statement
A professional robber plans to rob some houses along a street. These houses are arranged in a circle, which means that the first and the last house are neighbors. The robber cannot rob adjacent houses because they have security alarms installed.
Following the constraints mentioned above and given an integer array money representing the amount of money in each house, return the maximum amount the robber can steal without alerting the police.
Constraints:
-
money.length -
money[i]