-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.ts
71 lines (60 loc) · 1.91 KB
/
index.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
import run from "aocrunner";
const parseInput = (rawInput: string) => rawInput;
/**
* Get points from the number of winning numbers
* @param number Number of winning numbers
* @returns Points
*/
const points = (number: number) => number > 0 ? 2**(number - 1) : 0;
const part1 = (rawInput: string) => {
const input = parseInput(rawInput).split("\n");
let sum = 0;
input.forEach((line) => {
const [_, numbers] = line.split(": ");
const [winningNumbers, ticketNumbers] = numbers.split(" | ");
// find numbers and map to integers
const winningNumbersList = [...winningNumbers.matchAll(/\d+/g)].map(v => parseInt(v[0]));
const ticketNumbersList = [...ticketNumbers.matchAll(/\d+/g)].map(v => parseInt(v[0]));
// how many ticket numbers are also in the winning numbers
const winningNumbersCount = ticketNumbersList.filter((n) => winningNumbersList.includes(n)).length;
// add points to sum
sum += points(winningNumbersCount);
});
return sum;
};
const part2 = (rawInput: string) => {
const input = parseInput(rawInput);
return;
};
run({
part1: {
tests: [
{
input: `Card 1: 41 48 83 86 17 | 83 86 6 31 17 9 48 53
Card 2: 13 32 20 16 61 | 61 30 68 82 17 32 24 19
Card 3: 1 21 53 59 44 | 69 82 63 72 16 21 14 1
Card 4: 41 92 73 84 69 | 59 84 76 51 58 5 54 83
Card 5: 87 83 26 28 32 | 88 30 70 12 93 22 82 36
Card 6: 31 18 13 56 72 | 74 77 10 23 35 67 36 11`,
expected: 13,
},
],
solution: part1,
},
part2: {
tests: [
{
input: `Card 1: 41 48 83 86 17 | 83 86 6 31 17 9 48 53
Card 2: 13 32 20 16 61 | 61 30 68 82 17 32 24 19
Card 3: 1 21 53 59 44 | 69 82 63 72 16 21 14 1
Card 4: 41 92 73 84 69 | 59 84 76 51 58 5 54 83
Card 5: 87 83 26 28 32 | 88 30 70 12 93 22 82 36
Card 6: 31 18 13 56 72 | 74 77 10 23 35 67 36 11`,
expected: 30,
},
],
solution: part2,
},
trimTestInputs: true,
onlyTests: false,
});