From 7b14031af01ecb58d685ce546e51bb5cd995f5f9 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Wed, 10 Sep 2025 21:25:29 -0400
Subject: [PATCH] Time: 0 ms (100%), Space: 12.4 MB (55.59%) - LeetHub

---
 0198-house-robber/0198-house-robber.py | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/0198-house-robber/0198-house-robber.py b/0198-house-robber/0198-house-robber.py
index 0a3159a..5de1304 100644
--- a/0198-house-robber/0198-house-robber.py
+++ b/0198-house-robber/0198-house-robber.py
@@ -9,7 +9,7 @@ class Solution(object):
             return max(nums)
 
         # Subproblem: only nums 0 to i exist and i is always robbed
-        dp = [0] * len(nums)
+        dp = [0] * 3 # Optimized to only hold the last 3 entries
 
         dp[0] = nums[0]
         dp[1] = nums[1]
@@ -17,7 +17,8 @@ class Solution(object):
 
 
         for i in range(3, len(nums)):
-            dp[i] = nums[i] + max(dp[i - 2], dp[i - 3])
+            x = i % 3
+            dp[x] = nums[i] + max(dp[(x - 2) % 3], dp[x])
 
-        return max(dp[-1], dp[-2])
+        return max(dp)
         
\ No newline at end of file