fee37aebd0
day6: further performance improvement, ~55ms total runtime
...
We only need to run the guard forward from the step before the obstacle
we placed, instead of starting at the original starting position.
The code starts to look ugly...
2024-12-06 17:05:36 -08:00
b1918bbebf
day6: performance - only check obstacles on the original path
...
700ms -> 150ms
2024-12-06 10:59:43 -08:00
1cd535c2aa
chore: clippies
2024-12-06 10:52:31 -08:00
1dd3ce5862
day6: performance improvement
2024-12-06 10:40:28 -08:00
145d779e83
day6: complete solution + grid lib (used in solution)
2024-12-05 22:41:47 -08:00
49c37800a0
day5: complete solution
2024-12-04 22:41:33 -08:00
e2cd0fe9cc
day3: code format
2024-12-04 16:41:39 -08:00
6a619d756f
gitignore
2024-12-04 16:41:16 -08:00
dc67b38420
day3: disable unicode matching, don't recompile RE for every iteration
2024-12-04 16:41:00 -08:00
e5faee3470
day4: do a lot fewer allocations, performance improvement x10
2024-12-03 22:09:13 -08:00
a81904f2eb
day4: complete solution
2024-12-03 22:02:49 -08:00
ec55b07c61
boilerplate: fix it
2024-12-02 21:22:05 -08:00
7a7fb4d02a
day3: full solution
2024-12-02 21:18:37 -08:00
b24593a469
day2: performance and adopt new duration print
2024-12-01 23:02:00 -08:00
ec2651c3e4
boilerplate: improve duration printing
2024-12-01 21:32:17 -08:00
33c0c876c3
day2: full solution
2024-12-01 21:31:29 -08:00
968d795720
day 1: cleanup and refactor
...
* I misunderstood the problem and thought we were asked for the distance
between the numbers' positions, not their values. Removed remnants of
that.
* Move to struct-oriented solution
* Fix clippys and unnecessary code
2024-11-30 22:03:19 -08:00
8cab780ff3
day 1: problem 2 solution
2024-11-30 21:46:10 -08:00
892d59f21b
day 1: problem 1 solution
2024-11-30 21:38:31 -08:00
76cacf4704
gitignore
2024-11-30 21:37:02 -08:00
fd24918c7a
2024 AoC is here!
2024-11-30 21:36:05 -08:00
