def rob(nums: list[int]) -> int:
    if not nums:
        return 0
    if len(nums) == 1:
        return nums[0]

    # dp[i] = max money robbing houses 0..i
    dp = [0] * len(nums)
    dp[0] = nums[0]
    dp[1] = max(nums[0], nums[1])

    for i in range(2, len(nums)):
        # rob house i or skip it
        dp[i] = max(dp[i - 1], dp[i - 2] + nums[i])

    return dp[-1]

# Time: O(n), Space: O(n) -> can optimize to O(1)
# [1,2,3,1] -> 4 (rob house 0 and 2)
# [2,7,9,3,1] -> 12 (rob house 0, 2, 4)

Dynamic Programming — Fundamentals

Dynamic Programming — Fundamentals

Dynamic Programming — Fundamentals