Solution: House Robber II
Explore the House Robber II problem where houses are arranged in a circle and adjacent houses cannot be robbed. Understand how to apply dynamic programming, including bottom-up tabulation and space optimization, to efficiently calculate the maximum amount that can be stolen without triggering alarms.
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]