Solution: House Robber II
Explore the dynamic programming approach to the House Robber II problem, where houses are in a circle and adjacent thefts are prohibited. Learn how to split the problem into two sets, use bottom-up tabulation for optimal subproblem solutions, and reduce space complexity with variable tracking for efficient implementation and improved performance.
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]