Commit Graph

306 Commits

Author SHA1 Message Date
0523610080 chore: 2015D11 dataset 2025-12-04 16:24:24 +01:00
e341c12763 feat: include D11 2025-12-04 16:24:14 +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
8a9f4cb506 chore: add 2025D4 dataset 2025-12-04 06:29:55 +01:00
d3098c0d9c cleaning: input.txt is either downloaded or created empty 2025-12-03 15:17:24 +01:00
8be18b6b38 refactor: better explain scaffolding 2025-12-03 15:16:25 +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
1421062a75 chore: 2025D3 dataset 2025-12-03 09:26:19 +01:00
b9928789df feat: solve day10 using traditionnal look and say 2025-12-02 23:12:11 +01:00
b7aafeec52 test: no test 2025-12-02 23:11:09 +01:00
a935e35d82 feat: include 2015D10 2025-12-02 23:08:47 +01:00
e2c2d0df71 chore: 2015D10 dataset 2025-12-02 22:56:27 +01:00
e3a47b0e16 feat: solve part two 2025-12-02 22:13:31 +01:00
86370f27c8 refactor: create functions that we gonna use for part two 2025-12-02 22:10:12 +01:00
c61e573e14 test: add unit test for part two 2025-12-02 21:57:27 +01:00
d16f70cf00 feat: solve part one with brute-force and permutation enumeration 2025-12-02 21:56:06 +01:00
6f7561213e test: add unit test for part one 2025-12-02 21:52:56 +01:00
94b15548cf feat: include 2015D9 2025-12-02 21:23:49 +01:00
4e9e2b399c chore: add 2015D9 dataset 2025-12-02 21:23:24 +01:00
035e56bf53 feat: solve part two 2025-12-02 21:21:49 +01:00
61cf84aa8a test: add unit test for part two 2025-12-02 20:39:54 +01:00
5513ae8386 feat: solve part one using basic parsing 2025-12-02 20:38:20 +01:00
f1730c30cb feat: register D8 and parse input 2025-12-02 20:14:37 +01:00
ce7d42621f test: add unit test for part one 2025-12-02 20:13:01 +01:00
8eafb1f7c5 feat: include 2015D8 2025-12-02 19:55:26 +01:00
81be03e8ee chore: add 2015D8 dataset 2025-12-02 19:54:54 +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
b0d16b1bac git: add .test files to ignore 2025-12-02 11:51:21 +01:00
3eb9120dc3 clean: remove test file 2025-12-02 11:50:40 +01:00
85ae14acbf docs: update readme 2025-12-02 09:58:52 +01:00
b7a98033c6 refactor: use package aggregators 2025-12-02 09:51:34 +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
707f34e706 feat: include 2025D2 2025-12-02 06:36:56 +01:00
a05450c73a chore: add 2025D2 dataset 2025-12-02 06:27:22 +01:00