Leetcode 213. House Robber II

Given a circular array of nonnegative values where robbing two adjacent houses is forbidden, find the maximum total amount you can rob without alerting the police. The circular layout (first and last are adjacent) is the key twist that prevents a single linear non-adjacent selection DP and is typically handled by considering the two scenarios that exclude either the first or the last house.