|
|
d88d64edd4
|
chore: 2015D7 dataset
|
2025-12-01 22:43:24 +01:00 |
|
|
|
e81194721c
|
refactoring: just better naming
|
2025-12-01 21:53:50 +01:00 |
|
|
|
a680e0ba48
|
refactor: create parseInstruction and instruction{} to use it in both parts
|
2025-12-01 21:31:51 +01:00 |
|
|
|
345defec4d
|
feat: solve p2
|
2025-12-01 21:28:27 +01:00 |
|
|
|
3756279dab
|
test: add unit test for p2
|
2025-12-01 20:52:57 +01:00 |
|
|
|
70189f4295
|
feat: solve part one
|
2025-12-01 20:47:02 +01:00 |
|
|
|
cdacf7ae06
|
test: add unit test for p1 from paper calculation
|
2025-12-01 20:46:55 +01:00 |
|
|
|
074c762960
|
feat: add 2015D6 dataset
|
2025-12-01 20:35:08 +01:00 |
|
|
|
6babf31a20
|
feat: include 2015D6
|
2025-12-01 20:35:00 +01:00 |
|
|
|
cdefd68320
|
feat: add 2018D3 dataset
|
2025-12-01 20:09:37 +01:00 |
|
|
|
f28611a7bf
|
test: add unit tests for p1/p2
|
2025-12-01 20:09:29 +01:00 |
|
|
|
f98034b00c
|
feat: solve both parts
|
2025-12-01 20:09:20 +01:00 |
|
|
|
375b756718
|
feat: include 2018D3
|
2025-12-01 20:09:12 +01:00 |
|
|
|
6668e8ae1b
|
fix: remove empty branch
|
2025-12-01 19:37:28 +01:00 |
|
|
|
e58959778a
|
docs: update readme
|
2025-12-01 19:36:25 +01:00 |
|
|
|
eb72fe9ebd
|
build: get rid of "new" target
|
2025-12-01 19:35:01 +01:00 |
|
|
|
e355423675
|
feat: automatically download each day input
|
2025-12-01 19:32:01 +01:00 |
|
|
|
b1be29c21c
|
feat: solve part two using modular arithmetic
|
2025-12-01 12:35:20 +01:00 |
|
|
|
b04dcc5aea
|
test: add P2 unit test
|
2025-12-01 12:20:11 +01:00 |
|
|
|
11b6227d0e
|
feat: add P1 solution
|
2025-12-01 12:19:01 +01:00 |
|
|
|
31660c7510
|
test: add P1 unit test
|
2025-12-01 12:18:54 +01:00 |
|
|
|
728bbb2a06
|
feat: add input for 2022D2
|
2025-12-01 12:18:42 +01:00 |
|
|
|
16a99ba8d8
|
feat: include 2022D2
|
2025-12-01 12:18:36 +01:00 |
|
|
|
0949840317
|
feat: solve P2, same as P1 but check every time the dial passes through 0 during the rotation
|
2025-12-01 07:41:50 +01:00 |
|
|
|
daec5a8671
|
test: add unit test for p2
|
2025-12-01 07:35:03 +01:00 |
|
|
|
d66cd1179d
|
feat: solve P1 using modulo to keep it between boundaries
|
2025-12-01 07:31:15 +01:00 |
|
|
|
2d3828c55d
|
test: design unit test for part one
|
2025-12-01 07:20:12 +01:00 |
|
|
|
b7a7bfb5c7
|
feat: add 2025D1 input
|
2025-12-01 07:20:01 +01:00 |
|
|
|
be918bdf6c
|
feat: include 2025D1 let's gooooo
|
2025-12-01 07:19:55 +01:00 |
|
|
|
c8517b674f
|
docs: explain the string answers trick
|
2025-11-30 13:35:55 +01:00 |
|
|
|
f3d73b7c4b
|
feat: P2 solution using pairwise comparison
|
2025-11-30 13:08:46 +01:00 |
|
|
|
bcef8844ec
|
build: only test internal/
|
2025-11-30 13:04:18 +01:00 |
|
|
|
20ab5fe4e5
|
test: adapted p2 test as it expects string and not int
|
2025-11-30 13:04:08 +01:00 |
|
|
|
959c05b769
|
feat: add part one solution
|
2025-11-30 12:55:52 +01:00 |
|
|
|
4179c88afb
|
feat: include 2018D2
|
2025-11-30 12:50:47 +01:00 |
|
|
|
0dc0c3af3d
|
feat: 2018D2 dataset
|
2025-11-30 12:50:41 +01:00 |
|
|
|
c6dc950d3f
|
test: add unit test for p1
|
2025-11-30 12:50:33 +01:00 |
|
|
|
e5a1504f6b
|
feat: add solutions for P1/P2 2018D1
|
2025-11-30 12:46:09 +01:00 |
|
|
|
9da1fa02c8
|
feat: 2018D1 dataset
|
2025-11-30 12:46:01 +01:00 |
|
|
|
99857d8ca5
|
test: add unit tests for P1/P2
|
2025-11-30 12:45:53 +01:00 |
|
|
|
e198caf1b9
|
feat: include 2018D1
|
2025-11-30 12:45:45 +01:00 |
|
|
|
9dd5f1354f
|
docs: comment years
|
2025-11-29 16:15:14 +01:00 |
|
|
|
8ad1b166f3
|
feat: add both solutions
|
2025-11-29 16:07:02 +01:00 |
|
|
|
1f3b42b266
|
feat: 2015D5 dataset
|
2025-11-29 16:06:54 +01:00 |
|
|
|
9521677ca8
|
test: add unit tests for both parts
|
2025-11-29 16:06:42 +01:00 |
|
|
|
8938992384
|
feat: include 2015D5
|
2025-11-29 16:06:34 +01:00 |
|
|
|
a0ce63e5a5
|
feat: solve d4 both parts using md5 bruteforce
|
2025-11-29 09:57:54 +01:00 |
|
|
|
a12c8df252
|
test: add unit tests for both parts
|
2025-11-29 09:57:23 +01:00 |
|
|
|
8d69f10924
|
feat: include 2015D4
|
2025-11-29 09:55:47 +01:00 |
|
|
|
e41d1fa220
|
feat: add 2015D4 input
|
2025-11-29 09:55:39 +01:00 |
|
