Y
YeetCode
Dashboard
/
1-D Dynamic Programming
/
House Robber
Medium
#198
Decision DP
House Robber
Maximum amount you can rob without robbing adjacent houses.
Solve on LeetCode
↗
Full Explanation
Previous
← Climbing Stairs
Next
House Robber II →