House Robber
Last updated
What is House Robber?
You are a robber planning to steal from houses in a row. You cannot rob two adjacent houses. Find the maximum amount you can steal. At each house you choose to rob it and skip the previous, or skip it and keep the best from before. This problem teaches the classic DP choice between taking the current element and combining it with a past state, or skipping it.
Free resources to learn House Robber
More in stage 16: D Dynamic Programming
House Robber: common questions
Can I learn House Robber in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain House Robber in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this House Robber tutorial for beginners?
It is lesson 98 of 137 in the free LeetCode roadmap, in stage 16, D Dynamic Programming. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.