day 2

aoc

@@ -0,0 +1,9 @@
+#!/usr/bin/env zsh
+setopt extendedglob
+
+cd "day$1"
+
+# Handle deno days
+if [[ -n *.ts(#qN) ]]; then
+    deno eval --ext=ts "await import('./part$2.ts').then(m => m.solve()).then(s => console.log('The solution is', s))"
+fi

day1/part1.ts

@@ -1,16 +1,18 @@
-const input = await Deno.readTextFile("./input.txt").then(
+export async function solve() {
-    (f) =>
+    return await Deno.readTextFile("./input.txt").then(
-        f.split("\n").reduce<[number[], number[]]>(
+        (f) =>
-            (
+            f.split("\n").reduce<[number[], number[]]>(
-                acc,
+                (
-                cur,
+                    acc,
-            ) => [[...acc[0], +cur.split("   ")[0]], [
+                    cur,
-                ...acc[1],
+                ) => [
-                +cur.split("   ")[1],
+                    [...acc[0], +cur.split("   ")[0]],
-            ]],
+                    [...acc[1], +cur.split("   ")[1]],
-            [[], []],
+                ],
-        ),
+                [[], []],
-).then(([first, second]) => [first.toSorted(), second.toSorted()]).then((
+            ),
-    [first, second],
+    ).then(([first, second]) => [first.toSorted(), second.toSorted()]).then(
-) => first.reduce((acc, cur, i) => acc + Math.abs(cur - second[i]), 0));
+        ([first, second]) =>
-console.log("Answer = " + input);
+            first.reduce((acc, cur, i) => acc + Math.abs(cur - second[i]), 0),
+    );
+}

day1/part2.ts

@@ -1,24 +1,25 @@
-const input = await Deno.readTextFile("./input.txt").then(
+export async function solve() {
-    (f) =>
+    return await Deno.readTextFile("./input.txt").then(
-        f.split("\n").reduce<[number[], number[]]>(
+        (f) =>
-            (
+            f.split("\n").reduce<[number[], number[]]>(
-                acc,
+                (
-                cur,
+                    acc,
-            ) => [[...acc[0], +cur.split("   ")[0]], [
+                    cur,
-                ...acc[1],
+                ) => [
-                +cur.split("   ")[1],
+                    [...acc[0], +cur.split("   ")[0]],
-            ]],
+                    [...acc[1], +cur.split("   ")[1]],
-            [[], []],
+                ],
-        ),
+                [[], []],
-).then(([first, second]) => [
+            ),
-    first,
+    ).then(([first, second]) => [
-    second.reduce((acc, cur) => {
+        first,
-        if (acc[cur] !== undefined) acc[cur]++;
+        second.reduce((acc, cur) => {
-        else acc[cur] = 1;
+            if (acc[cur] !== undefined) acc[cur]++;
+            else acc[cur] = 1;
 
-        return acc;
+            return acc;
-    }, {} as Record<number, number>),
+        }, {} as Record<number, number>),
-]).then(([first, map]) =>
+    ] as const).then(([first, map]) =>
-    first.reduce((acc, cur) => acc + ((map[cur] ?? 0) * cur), 0)
+        first.reduce((acc, cur) => acc + ((map[cur] ?? 0) * cur), 0)
-);
+    );
-console.log("Answer = " + input);
+}

day2/part1.ts

@@ -0,0 +1,17 @@
+export async function solve() {
+    return await Deno.readTextFile("./input.txt").then((f) =>
+        f.split("\n").filter((l) => {
+            const report = l.split(" ").map((s) => +s);
+            const increasing = report[0] < report[1];
+            let last = report[0];
+            for (const number of report.slice(1)) {
+                if (number > last && !increasing) return false;
+                if (number < last && increasing) return false;
+                if (Math.abs(number - last) < 1 || Math.abs(number - last) > 3) return false;
+    
+                last = number;
+            }
+            return true;
+        }).reduce(acc => acc + 1, 0)
+    );    
+}

day2/part2.ts

@@ -0,0 +1,29 @@
+export async function solve() {
+    return await Deno.readTextFile("./input.txt").then((f) =>
+        f.split("\n").filter((l) => {
+            const report = l.split(" ").map((s) => +s);
+            for (let i = 0; i < report.length; i++) {
+                const sliced = [
+                    ...report.slice(0, i),
+                    ...report.slice(i + 1, report.length),
+                ];
+                const increasing = sliced[0] < sliced[1];
+                let last = sliced[0];
+                let failed = false;
+                for (const number of sliced.slice(1)) {
+                    if (number > last && !increasing) failed = true;
+                    if (number < last && increasing) failed = true;
+                    if (
+                        Math.abs(number - last) < 1 ||
+                        Math.abs(number - last) > 3
+                    ) failed = true;
+
+                    last = number;
+                }
+                if (failed) continue;
+                else return true;
+            }
+            return false;
+        }).reduce((acc) => acc + 1, 0)
+    );
+}