My solutions to AOC2023.
- Pure rust
- No external libraries
- Modular code
- Error handling (Where nescessary)
- Learn more efficient algorithms/optimizations
- All days combined running in under 1s
Each solution has it's own self-contained library, where i try to make it more as a maintainable piece of code, rather than just solving the issue in one function or alike.
Links can be found in the table below:
| Day | Solution |
|---|---|
| 01 | lib/trebuchet |
| 02 | lib/cube_game |
| 03 | lib/gondola_lift |
| 04 | lib/scratchcard |
| 05 | lib/almanac |
| 06 | lib/boat_race |
| 07 | lib/camel_cards |
| 08 | lib/network_nodes |
| 09 | lib/oasis |
| 10 | lib/pipe_maze |
| 11 | lib/observatory |
| 12 | 🕙TBD |
| 13 | 🕙TBD |
| 14 | 🕙TBD |
| 15 | 🕙TBD |
| 16 | 🕙TBD |
| 17 | 🕙TBD |
| 18 | 🕙TBD |
| 19 | 🕙TBD |
| 20 | 🕙TBD |
| 21 | 🕙TBD |
| 22 | 🕙TBD |
| 23 | 🕙TBD |
| 24 | 🕙TBD |
| 25 | 🕙TBD |
-
Day 5 (Part 2) - Completed without any external help. I however had to resort to getting a hint on what algorithm to use in order to optimize, as my initial solution ran for +10 minutes. A small win on implementing an algorithm i didn't know before (Ford–Fulkerson).
-
Day 8 (Part 2) - Completed but never finished completely on my own as my initial solution ran for hours without ever ending (Which i knew would happen..). I had to get a hint on how to optimize this, which lead to implementing LCM.
-
Day 10 (Part 2) - After 12 hours of hacking away, i couldn't get a solution running that worked. Got a hint about implementing Picks Theorem with the Shoelace algorithm, which i tried (And apparently succeeded), but resorted to posting on reddit as it didn't work. It was however, another bug/mistake that caused it not to work - Not the algorithm itself nessecarily.