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.

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid December, 2025

Amazon

Senior

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 213. House Robber II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact