198. House Robber in progress

Author: Ryo112358

Medium/HouseRobber.ts

@@ -0,0 +1,49 @@
+/*
+ * Problem: 198. House Robber
+ * Acceptance Rate: 43.8%
+ * URL: https://leetcode.com/problems/house-robber/
+ *
+ * Runtime: 
+ * Memory Usage: 
+ */
+
+export default function rob(houses: number[]): number {
+    Solution.planHeist(houses);
+    return Solution.rob(0, houses);
+}
+
+class Solution {
+    private static moneyRobbed: number;
+    private static neighborhood: number[];
+
+    static planHeist(neighborhood: number[]) {
+        Solution.neighborhood = neighborhood;
+    }
+
+    static rob(startingHouseIndex: number, neighborhood: number[]): number {
+        Solution.moneyRobbed = neighborhood[0];
+
+        for(let i=2; i < neighborhood.length; i+=2) {
+        }
+
+        return 0;
+    }
+
+    private static _moreValuableHouse(x: number, y: number): number {
+        return Solution.neighborhood[x] > Solution.neighborhood[y] ? x : y;
+    }
+
+}
+
+//---------------------------------------------------------------------
+// ----------                 MAIN PROGRAM                   ----------
+//---------------------------------------------------------------------
+if(import.meta.main) {
+
+    rob([1,2,3,1]);
+    // rob([2,7,9,3,1]);
+
+    // RUN: deno run medium/HouseRobber.ts
+}
+
+// --------------------------- Terminal Output: ---------------------------

Medium/test/HouseRobber.test.ts

@@ -0,0 +1,27 @@
+import { assertEquals } from '../../test_deps.ts';
+
+import rob from '../HouseRobber.ts';
+
+// RUN: deno test medium/test/HouseRobber.test.ts
+
+//---------------------------------------------------------------------
+// ----------                  UNIT TESTS                    ----------
+//---------------------------------------------------------------------
+
+Deno.test({
+    name: "[1,2,3,1] -> 4",
+    fn() {
+        let neighborhood = [1,2,3,1];
+        assertEquals(rob(neighborhood), 4);
+    }
+});
+
+
+
+Deno.test({
+    name: "[2,7,9,3,1] -> 12",
+    fn() {
+        let neighborhood = [2,7,9,3,1];
+        assertEquals(rob(neighborhood), 12);
+    }
+});

Medium/test/LongestPalindromicSubstring.test.ts

@@ -1,6 +1,6 @@
 import { assertEquals, assertNotEquals } from '../../test_deps.ts';
 
-import longestPalindromeIn from "../LongestPalindromicSubstring.ts";
+import longestPalindromeIn from '../LongestPalindromicSubstring.ts';
 
 
 // RUN: deno test medium/test/LongestPalindromicSubstring.test.ts

README.md

@@ -1,4 +1,4 @@
-# Leetcode Solutions in TypeScript
+# LeetCode Solutions in TypeScript
 
 ## Environment
 - <span title="July 2021">Deno 1.12.0</span>
@@ -7,5 +7,7 @@
 
 ## Problems Completed
 
+Java Solutions – [CoffeelessProgrammer/leetcode-java](https://github.com/CoffeelessProgrammer/leetcode-java)
+
 ### Medium
 - <span title="Acceptance Rate: 31.0%">5. Longest Palindromic Substring</span>