Loading…
House Robber is a medium coding interview question covering dynamic programming, arrays — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
You are a robber planning to rob houses along a street. Each house has a non-negative amount of money, but adjacent houses share an alarm: robbing two neighboring houses trips it. Given the array of amounts, return the maximum money you can rob without ever robbing two adjacent houses.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.