|
|
78b0032578
|
feat: solve PartOne using DFS algorithm
|
2025-12-07 09:54:53 +01:00 |
|
|
|
536f6f52ff
|
refactor: return directly
|
2025-12-07 09:35:20 +01:00 |
|
|
|
96ca1afb9b
|
test: add unit test for PartOne
|
2025-12-07 09:30:18 +01:00 |
|
|
|
780263e78b
|
feat: register day seven
|
2025-12-07 09:27:51 +01:00 |
|
|
|
3d35a57723
|
feat: solve part two using right-to-left processing
|
2025-12-06 12:08:57 +01:00 |
|
|
|
0d40e32a39
|
test: add unit test for part two
|
2025-12-06 11:48:22 +01:00 |
|
|
|
fd34db28cb
|
feat: solve part one using grid transposition
|
2025-12-06 11:46:50 +01:00 |
|
|
|
65edd3258e
|
test: unit test for part one
|
2025-12-06 11:07:39 +01:00 |
|
|
|
e914bc6492
|
feat: register day six
|
2025-12-06 11:04:13 +01:00 |
|
|
|
00ccbaf0d0
|
feat: solve part two using merged ranges
|
2025-12-05 09:08:10 +01:00 |
|
|
|
51f733127c
|
test: add unit test for part two
|
2025-12-05 08:46:10 +01:00 |
|
|
|
d96febeae3
|
feat: solve part one using binary search on sorted range
|
2025-12-05 08:41:39 +01:00 |
|
|
|
79b31dad19
|
test: add unit test for part one
|
2025-12-05 08:03:50 +01:00 |
|
|
|
d5146e7e3e
|
feat: include day five
|
2025-12-05 08:01:50 +01:00 |
|
|
|
6cff0b7931
|
feat: solve part two with iterative process
|
2025-12-04 07:05:56 +01:00 |
|
|
|
f5bfe1e578
|
test: unit test for part two
|
2025-12-04 06:48:41 +01:00 |
|
|
|
0fbe2956c3
|
refactor: didn't press :w it seems
|
2025-12-04 06:46:28 +01:00 |
|
|
|
9280430285
|
feat: solve part one using prebuilt map for rolls
|
2025-12-04 06:45:40 +01:00 |
|
|
|
b91e34bc8e
|
test: add unit test for part one
|
2025-12-04 06:32:20 +01:00 |
|
|
|
9f10576a0c
|
feat: include 2025D4
|
2025-12-04 06:30:23 +01:00 |
|
|
|
b39b8c885b
|
feat: solve part two, still with greedy algorithm
|
2025-12-03 10:36:14 +01:00 |
|
|
|
56901ca553
|
test: add unit test for part two
|
2025-12-03 10:10:45 +01:00 |
|
|
|
e3c9da9621
|
feat: solve part one using a prebuild list to reduce comparisons
|
2025-12-03 10:09:13 +01:00 |
|
|
|
070bd8be9a
|
fix: modify test, we're parsing [][]int instead of []string for this day
|
2025-12-03 09:57:12 +01:00 |
|
|
|
c1ba2ca02b
|
test: add unit test for part one
|
2025-12-03 09:28:42 +01:00 |
|
|
|
146b63706a
|
feat: include 2025D3
|
2025-12-03 09:26:32 +01:00 |
|
|
|
d662f693b8
|
feat: don't bruteforce every number, use recursion to generate patterns to look for
|
2025-12-02 18:09:45 +01:00 |
|
|
|
8f265eae05
|
feat: add per-year aggregator packages so main.go remains readable
|
2025-12-02 09:51:21 +01:00 |
|
|
|
fe20a0b654
|
feat: solve part two using a bit of bruteforce
|
2025-12-02 07:48:48 +01:00 |
|
|
|
aa80e4eb8e
|
revert: remove useless helper as PartOne and PartTwo will have a different behavior
|
2025-12-02 07:35:50 +01:00 |
|
|
|
0d029f2861
|
feat: unify invalid checks with exactTwo boolean parameter
|
2025-12-02 07:19:57 +01:00 |
|
|
|
edf94432f4
|
test: add unit test for part two
|
2025-12-02 06:53:45 +01:00 |
|
|
|
33552358f8
|
feat: solve p1
|
2025-12-02 06:52:30 +01:00 |
|
|
|
45d3e93a93
|
test: add unit test for p1
|
2025-12-02 06:46:42 +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 |
|
