Commit Graph

188 Commits

Author SHA1 Message Date
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
d2d6f280b3 chore: 2025D5 dataset 2025-12-05 08:01:40 +01:00
79d9f8d7cc feat: solve part two using json and recursive approach 2025-12-04 21:10:42 +01:00
bcc4fc3432 test: add unit testing for part two 2025-12-04 21:00:19 +01:00
cc2d7d1a3d feat: solve part one using basic regex parsing 2025-12-04 20:59:09 +01:00
83f6db5e33 test: unit tests case for p1 2025-12-04 20:54:43 +01:00
12b54d51d2 feat: include D12 2025-12-04 20:44:48 +01:00
89c154de37 chore: add 2015D12 dataset 2025-12-04 20:44:17 +01:00
ea037debed fix: silence golangci-lint 2025-12-04 17:35:49 +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
77a352aa2e feat: solve part two using the same logic, twice 2025-12-04 16:53:15 +01:00
fd6db0cc65 refactor: add code in helpers for part two 2025-12-04 16:52:28 +01:00
2b548fa1ef feat: solve part one with pruned bruteforce 2025-12-04 16:49:43 +01:00
e0465b9b8d clean: no test cases for this day 2025-12-04 16:32:43 +01:00
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
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