Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

House Robber II

Medium

00:00

0 users online

Given houses in a circle, find maximum amount you can rob without robbing adjacent houses.

Sample Input:

[2,3,2]

Sample Output:

Hints

Hint 1

Break circular problem into two linear problems

Hint 2

Case 1: Rob houses 0 to n-2 (exclude last)

Hint 3

Case 2: Rob houses 1 to n-1 (exclude first)

Code Editor

Loading...