Solution: House Robber II

Explore how to apply dynamic programming techniques to solve the House Robber II problem, where houses are arranged in a circle. This lesson helps you understand optimizing robbery amounts without robbing adjacent houses by dividing the problem, using bottom-up tabulation, and improving space complexity.

We'll cover the following...

Statement
Solution
- Naive approach
- Optimized approach using dynamic programming

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:

$1\leq$ money.length $\leq 10^3$
$0\leq$ money[i] $\leq 10^3$

...