solve: Week 01 house robber

Author: eunice-hong

house-robber/eunice-hong.ts

@@ -0,0 +1,16 @@
+/**
+ * Finds the maximum amount of money that can be robbed without robbing two adjacent houses.
+ * Uses dynamic programming to track the best outcome at each step.
+ * 
+ * @param {number[]} nums
+ * @return {number}
+ */
+function rob(nums: number[]): number {
+    const dp = new Array(nums.length + 1);
+    dp[0] = 0;
+    dp[1] = nums[0];
+    for (let i = 2; i < dp.length; i++) {
+        dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i - 1]);
+    }
+    return dp[dp.length - 1];
+};