Merge pull request #13 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/198. House Robber/198. House Robber.py

@@ -0,0 +1,9 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        @cache
+        def dfs(i: int) -> int:
+            if i >= len(nums):
+                return 0
+            return max(nums[i] + dfs(i + 2), dfs(i + 1))
+
+        return dfs(0)