|
|
3bbe8d9f7d
|
refactor: use Cut() instead of Index()
|
2026-03-16 15:35:06 +01:00 |
|
|
|
a0a0c43690
|
feat: simplified input parsing by appending all lines directly
|
2025-12-04 17:32:36 +01:00 |
|
|
|
bce49d51f7
|
feat: applied De Morgan simplification
|
2025-12-04 17:32:18 +01:00 |
|
|
|
8f265eae05
|
feat: add per-year aggregator packages so main.go remains readable
|
2025-12-02 09:51:21 +01:00 |
|
|
|
98fb052039
|
feat: add p2 solution
|
2025-11-28 15:33:23 +01:00 |
|
|
|
db685a1290
|
test: add p2 unit test
|
2025-11-28 15:26:30 +01:00 |
|
|
|
27a56dc7cd
|
refactor: create a execute() function to reuse in part two
|
2025-11-28 15:26:23 +01:00 |
|
|
|
6a82336c99
|
feat: add part one solution
|
2025-11-28 14:54:29 +01:00 |
|
|
|
228d8b475b
|
test: add unit test for part one
|
2025-11-28 14:54:16 +01:00 |
|
|
|
60ffe95f69
|
feat: implement PartTwo using DFS recursion
|
2025-11-28 12:53:29 +01:00 |
|
|
|
5d63f3c4d6
|
test: add unit test for part two
|
2025-11-28 12:02:23 +01:00 |
|
|
|
ceb3502c96
|
refactor: prepare part two, which will use the same parsing logic + new structure
|
2025-11-28 12:02:14 +01:00 |
|
|
|
d783d14ecc
|
test: add PartOne unit test
|
2025-11-28 11:31:55 +01:00 |
|
|
|
1fe2e30ef8
|
feat: use a BFS approach to solve part one
|
2025-11-28 11:31:43 +01:00 |
|
|
|
41007ef20e
|
go: fmt
|
2025-11-28 11:28:19 +01:00 |
|
|
|
3fb71d0cbf
|
refactor: standardize PartOne/PartTwo declarations
|
2025-11-28 09:01:11 +01:00 |
|
|
|
3723f84d1a
|
refactor: massive refactor to have only one binary to call
|
2025-11-26 14:04:13 +01:00 |
|
