Add tests and implementation for

cubeConundrumPartTwo

Author: vicainelli

src/day-02/cube-conundrum.test.ts

@@ -28,4 +28,15 @@ describe("Day 02, cube conundrum", () => {
       expect(result).toEqual(2716);
     });
   });
+
+  describe("Part Two", () => {
+    test("it should return 2286, example", () => {
+      const result = cubeConundrumPartTwo(content_example);
+      expect(result).toEqual(2286);
+    });
+    test("it should return 2716, input", () => {
+      const result = cubeConundrumPartTwo(content_input);
+      expect(result).toEqual(72227);
+    });
+  });
 });

src/day-02/cube-conundrum.ts

@@ -39,3 +39,40 @@ export function cubeConundrumPartOne(content: string): number {
       }, 0)
   );
 }
+
+export function cubeConundrumPartTwo(content: string): number {
+  // Split the content into lines
+  const lines = content.trim().split("\n");
+
+  // Process each line
+  return (
+    lines
+      .map((line) => {
+        // Split the line into sets
+        const sets = line.split(": ")[1].split("; ");
+
+        // find the highest count for each color
+        const highestCount: maxCountType = sets.reduce(
+          (acc: maxCountType, set: string) => {
+            const pulls = set.split(", ");
+            pulls.forEach((pull) => {
+              const [count, color] = pull.split(" ");
+              if (acc[color] < Number(count)) {
+                acc[color] = Number(count);
+              }
+            });
+            return acc;
+          },
+          { red: 0, green: 0, blue: 0 }
+        );
+
+        // multiply the results and return
+        return Object.values(highestCount).reduce(
+          (acc, count) => acc * count,
+          1
+        );
+      })
+      // Sum up the results
+      .reduce((sum, result) => sum + result, 0)
+  );
+}