Back to DSA sheet

House Robber

MediumDynamic Programming
Open on LeetCodeAmazonGoogleMicrosoft

Maximize the loot from houses in a row where robbing two adjacent houses triggers the alarm.

Constraints
  • 1 <= n <= 100
  • 0 <= nums[i] <= 400
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
house-robber.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.