Commit Graph

67 Commits

Author SHA1 Message Date
7abe9e7dc6 test: add unit test for part one 2026-02-03 19:02:08 +01:00
d19c8e2dcd feat: parse input 2026-02-03 19:00:14 +01:00
0f9bc8bfd6 feat: register last day 2026-02-03 18:59:22 +01:00
6617f5365e refactor+feat: use bitmask approach and cyclic/acyclic dfs for resolution 2026-02-03 16:30:08 +01:00
948be64119 test: add unit test for part two 2026-02-03 16:10:35 +01:00
9de558024f feat: solve part one using dfs approach 2026-02-03 16:08:30 +01:00
a6eb8f9f22 test: add unit test for p1 2026-02-03 16:02:17 +01:00
9ae920d6a8 feat: base code and input parsing for D11 2026-02-03 16:02:11 +01:00
326333e6bb feat: register eleventh day 2026-02-03 16:01:48 +01:00
106113023b feat: D10P2 solution 2026-01-30 20:49:06 +01:00
8503cee52b test: add unit test for part two 2025-12-10 18:41:25 +01:00
b16b052115 feat: solve part one using brute-force 2025-12-10 16:51:57 +01:00
bc76283458 test: add unit test for part one 2025-12-10 06:11:04 +01:00
9d2a087801 feat: register tenth day 2025-12-10 06:10:57 +01:00
5dab84eeb3 feat: solve part two 2025-12-09 14:40:37 +01:00
2283b62503 clean: oneliner for compute and check 2025-12-09 07:10:30 +01:00
ccf50c12c9 test: add unit test for part two 2025-12-09 06:45:39 +01:00
f25d7511aa feat: solve part one 2025-12-09 06:33:16 +01:00
243ccf3da9 test: unit test for part one 2025-12-09 06:14:02 +01:00
c053c905ad feat: register ninth day 2025-12-09 06:05:42 +01:00
5631822e73 feat: tiny refactor for part two which we're solving using Kruskal's algorithm 2025-12-08 15:21:42 +01:00
630d32ba11 test: add unit test for part two 2025-12-08 12:30:10 +01:00
22500b7076 feat: solve part one 2025-12-08 12:26:37 +01:00
9d2d27b257 refactor: rename parameter to standardize 2025-12-08 11:42:12 +01:00
a0805111b4 test: add unit test for part one 2025-12-08 06:08:56 +01:00
b0cd4f37b1 feat: register day 8 2025-12-08 06:01:48 +01:00
deac7f97bb refactor: format imports 2025-12-07 13:34:14 +01:00
a3fb7ac353 feat: solve part two using recursive dfs + memoization 2025-12-07 12:24:40 +01:00
8f4e11215f test: add unit test for part two 2025-12-07 09:55:03 +01:00
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