House Robber

MediumDynamic ProgrammingDynamic Programming

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night**. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight **without alerting the police**.

Examples

Input: nums = [1,2,3,1]
Output: 4
Rob house 1 (money = 1) and then rob house 3 (money = 3). Total = 1 + 3 = 4.
Input: nums = [2,7,9,3,1]
Output: 12
Rob house 1, 3, and 5 (money = 2 + 9 + 1 = 12).

Constraints

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More Dynamic Programming problems