Commit graph

11 commits

Author SHA1 Message Date
906acdbe62 Solved day 6 part 1. Part 2 looks scarier
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-06 21:08:20 +00:00
4a266a3dc1 Solved day 5, fun!
Using a hash map of hash maps would have made these solutions cleaner
and probably more efficient as well, but I wanted to do some bit
wrangling and I liked the idea of storing the rules in a single integer.

Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-05 21:15:44 +00:00
27d3095fad Solved day 4 part 2. Much easier than part 1...
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-04 22:53:40 +00:00
a60010f7bc Solved day 4 part 1 with dynamic programming.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-04 22:40:13 +00:00
883190e2ee Solved day 3 part 2. Adapted state machine to support do and dont.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-03 20:44:28 +00:00
467657b4d7 Solved day 3 part 1 in linear time with constant memory.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-03 19:42:59 +00:00
6c6d164c89 Move inputs to a separate directory.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-03 09:56:07 +00:00
b4198a1d6b Solved day 2 with O(n*m^2) for part 2.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-02 22:33:00 +00:00
00803fd554 Add helpers for parsing.
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-02 22:32:12 +00:00
96a49994f5 Done with day 1!!!
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
2024-12-01 08:16:43 +00:00
da201174a4 Initial commit 2024-11-30 21:14:20 -08:00