solulubeta
Sign in
NeetCode 150 / 1-D Dynamic Programming
13.03 · Problem

House Robber

Medium Take-or-skip DP 1 video LC 198 Pro

This problem is part of solulu Pro

Houses along a street hold nums[i] money. You can't rob two adjacent houses. Return the maximum amount you can rob.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 101 of 150 · updated 2026-10-12