d8 p1

Author: wiktoriavh

inputs/8.txt

@@ -0,0 +1,50 @@
+..................................................
+.r................................................
+..........................I.......................
+........................I.........................
+................................................M.
+............h......................A..............
+..7....................I.........h................
+......7..................................M....9...
+.o.....U..........................................
+......................................O...........
+....c.................J................O...M...A..
+..................................................
+...R...7..........................................
+..............r...................................
+...................J..................9...........
+...7..K......UJ...................................
+......0...U.........................x.............
+.......R.......0..B......................x........
+.......................k.....Z.......9............
+.......L.........I.....J............m.............
+.....K.BR........r.0.C............................
+.......K.BR......c................................
+..................h....m....Al...........H........
+..............L..k.......h...m..........x..9......
+........................Z.....m........xO.........
+..........0................l......................
+.6..................b.............................
+............k...o..............Z..................
+........4.....o...........L.......................
+....................Xo............................
+...........8..B..L.........i......................
+..z...............bX..........A...................
+j........z...X......C.......i........5............
+.b...H6.......................U.......l...........
+..................X...............................
+...6......................Z..........a............
+....6........c............5.........1.............
+.4.......................5........................
+..........k.......H1l.............................
+2.................C.......i...................u...
+.............a....2...............................
+.....z....H.......1..8.....................u......
+...........j...b..................................
+3.........j.........................a.............
+...4................a.............................
+..M................j.....1..........5.............
+............................................u.....
+..4..3...........i................................
+z3.................2..............................
+..........8..................2.C..................

src/7.ts

@@ -59,7 +59,7 @@ function solution(input: string): { part1: string; part2: string } {
       if (index === nums.length) {
         return;
       }
-      console.log(a, b, index);
+      //console.log(a, b, index);
 
       const alpha = calculate(a, b, "+");
       const beta = calculate(a, b, "*");
@@ -81,7 +81,7 @@ function solution(input: string): { part1: string; part2: string } {
       }
     };
 
-    bar(nums[0], nums[1], 1);
+    //bar(nums[0], nums[1], 1);
   });
 
   const sum = (acc: number, curr: number) => acc + curr;

src/8.ts

@@ -0,0 +1,70 @@
+function solution(input: string): { part1: string; part2: string } {
+  let result1 = 0;
+  let result2 = 0;
+
+  const lines = input.split("\n").map((line) => line.split(""));
+
+  const antennaCoordinates = new Map<string, Set<string>>();
+
+  lines.forEach((line, y) => {
+    line.forEach((cell, x) => {
+      if (cell !== ".") {
+        if (!antennaCoordinates.has(cell)) {
+          antennaCoordinates.set(cell, new Set<string>());
+        }
+        const antennas = antennaCoordinates.get(cell)!;
+        antennaCoordinates.set(cell, antennas.add(`${x},${y}`));
+      }
+    });
+  });
+
+  const antennaTypes = antennaCoordinates.keys();
+  const antinodeCoordinates = new Set<string>();
+
+  for (const type of antennaTypes) {
+    const coordinates = Array.from(antennaCoordinates.get(type)!).map((coord) =>
+      coord.split(",").map((c) => parseInt(c))
+    );
+
+    let pointer = 0;
+
+    while (pointer < coordinates.length) {
+      const [x, y] = coordinates[pointer];
+
+      coordinates.forEach(([x2, y2]) => {
+        if (x === x2 && y === y2) {
+          return;
+        }
+
+        const dx = x2 - x;
+        const dy = y2 - y;
+
+        const nodeX = x - dx;
+        const nodeY = y - dy;
+
+        if (
+          nodeX < 0 ||
+          nodeY < 0 ||
+          nodeX >= lines[0].length ||
+          nodeY >= lines.length
+        ) {
+          return;
+        }
+
+        const antinode = `${nodeX},${nodeY}`;
+        antinodeCoordinates.add(antinode);
+      });
+
+      pointer++;
+    }
+  }
+
+  result1 = antinodeCoordinates.size;
+
+  return {
+    part1: result1.toString(),
+    part2: result2.toString(),
+  };
+}
+
+export default solution;

test/8.test.ts

@@ -0,0 +1,31 @@
+import { expect, test, describe } from "bun:test";
+import solution from "../src/8";
+
+const EXAMPLE_1 = `............
+........0...
+.....0......
+.......0....
+....0.......
+......A.....
+............
+............
+........A...
+.........A..
+............
+............`;
+const RESULT_1 = "14";
+
+const EXAMPLE_2 = EXAMPLE_1;
+const RESULT_2 = "31";
+
+describe("Day 8", () => {
+  test("Part 1", () => {
+    const result = solution(EXAMPLE_1);
+    expect(result.part1).toBe(RESULT_1);
+  });
+
+  test("Part 2", () => {
+    const result = solution(EXAMPLE_2);
+    expect(result.part2).toBe(RESULT_2);
+  });
+});