2024 Day 25 complete

Author: MitchellSlavik

aoc2024/.aocrunner.json

@@ -370,13 +370,13 @@
     },
     {
       "part1": {
-        "solved": false,
-        "result": null,
+        "solved": true,
+        "result": "2978",
         "attempts": [],
-        "time": null
+        "time": 3.1022
       },
       "part2": {
-        "solved": false,
+        "solved": true,
         "result": null,
         "attempts": [],
         "time": null

aoc2024/README.md

@@ -35,7 +35,7 @@
 [![Day](https://badgen.net/badge/22/%E2%98%85%E2%98%85/green)](src/day22)
 [![Day](https://badgen.net/badge/23/%E2%98%85%E2%98%85/green)](src/day23)
 [![Day](https://badgen.net/badge/24/%E2%98%85%E2%98%85/green)](src/day24)
-![Day](https://badgen.net/badge/25/%E2%98%86%E2%98%86/gray)
+[![Day](https://badgen.net/badge/25/%E2%98%85%E2%98%85/green)](src/day25)
 
 <!--/SOLUTIONS-->
 
@@ -237,14 +237,14 @@ Both parts: 2.003ms
 
 ```
 Day 25
-Time part 1: -
+Time part 1: 3.102ms
 Time part 2: -
-Both parts: -
+Both parts: 3.102ms
 ```
 
 ```
-Total stars: 47/50
-Total time: 4099.017ms
+Total stars: 50/50
+Total time: 4102.119ms
 ```
 
 <!--/RESULTS-->

aoc2024/src/day25/README.md

@@ -0,0 +1,9 @@
+# 🎄 Advent of Code 2024 - day 25 🎄
+
+## Info
+
+Task description: [link](https://adventofcode.com/2024/day/25)
+
+## Notes
+
+...

aoc2024/src/day25/index.ts

@@ -0,0 +1,67 @@
+import run from "aocrunner";
+
+const parseInput = (rawInput: string) => {
+  const sections = rawInput.split("\n\n").map((sec) => sec.split("\n"));
+
+  const keys: number[][] = [];
+  const locks: number[][] = [];
+
+  sections.forEach((s) =>  {
+    let key = [];
+    for(let x= 0; x < s[0].length; x++){
+      let count = 0;
+      for(let y = 0; y < s.length; y ++) {
+        if(s[y][x] === '#'){
+          count++;
+        }
+      }
+      key.push(count);
+    }
+    if(s[0][0]  ===  '.'){
+      keys.push(key);
+    }else {
+      locks.push(key);
+    }
+  })
+
+  return { keys, locks }
+};
+
+const part1 = (rawInput: string) => {
+  const {keys, locks} = parseInput(rawInput);
+
+  return keys.map((k) => {
+    return locks.filter((l) => {
+      return k.every((v, i) => v + l[i] <= 7)
+    }).length
+  }).reduce((prev, curr) => prev + curr, 0)
+};
+
+const part2 = (rawInput: string) => {
+  const input = parseInput(rawInput);
+
+  return;
+};
+
+run({
+  part1: {
+    tests: [
+      // {
+      //   input: ``,
+      //   expected: "",
+      // },
+    ],
+    solution: part1,
+  },
+  part2: {
+    tests: [
+      // {
+      //   input: ``,
+      //   expected: "",
+      // },
+    ],
+    solution: part2,
+  },
+  trimTestInputs: true,
+  onlyTests: false,
+});