Merge pull request #2 from avolutions/day-1

Day 1

Author: avolutions

README.md

@@ -9,7 +9,7 @@ My solutions for [Advent of Code 2024](https://adventofcode.com/) written in Typ
  > npm install
 3. Build:
  > npm run build
- 
+
 # Usage
 The solutions to the puzzles for each day can be selected and executed separately.
 
@@ -34,3 +34,4 @@ After executing the solution, either by selecting it from the list or by calling
 # Solutions
 Day | Command | Part 1 | Part 2
 --- | --- | --- | ---
+[Day 1: Historian Hysteria](https://adventofcode.com/2024/day/1) | `npm run advent 1` | [57fb22f](https://github.com/avolutions/adventofcode/commit/57fb22ff139de656c4bbea2c93026f88a4732ad2) | [f51986c](https://github.com/avolutions/adventofcode/commit/f51986c200f3ee12aaa65e7487fe87a1291f4635)

src/day-1/index.ts

@@ -0,0 +1,44 @@
+import { readFileFromCurrentDirectory } from '../utils/readFile.js';
+
+const content = readFileFromCurrentDirectory();
+
+const leftValues: number[] = [];
+const rightValues: number[] = [];
+
+// Split the content into lines
+const lines = content.trim().split("\n");
+
+// Process each line and split into columns
+lines.forEach(line => {
+ const [left, right] = line
+ .trim()
+ .split(/\s+/)
+ .map(Number); // Split by spaces or tabs and convert to numbers
+
+ leftValues.push(left);
+ rightValues.push(right);
+});
+
+// Sort arrays in ascending order
+leftValues.sort((a, b) => a - b);
+rightValues.sort((a, b) => a - b);
+
+// Calculate distance between the values
+const distance = leftValues.reduce((sum, left, index) => {
+ return sum + Math.abs(left - rightValues[index]);
+}, 0);
+
+console.log("Part 1: " + distance);
+
+// Calculate similarity score
+let similarityScore = 0;
+
+for (const leftValue of leftValues) {
+ // Count how many times the left value appears in right list
+ const appearanceInRight = rightValues.filter(rightValue => rightValue === leftValue).length;
+
+ // Calculate similarity score
+ similarityScore += (leftValue * appearanceInRight);
+}
+
+console.log("Part 2: " + similarityScore);