Solutions for Advent of Code
Anders Ytterström
c0d352cdf1
I struggled a lot with the direction, but realised way too much later that the mappings are bidirectional. Part 2 was exceptionally hard, but I realised early that the order did not matter and that a simple boolean lock was all that was needed. The challenge was to know when to watch for duplicates. The seen was initially a set, but since new sets must be sent instead of references, a list is used instead to be able to use the seen + [] hack. |
||
|---|---|---|
| 2015-elixir | ||
| 2016-python | ||
| 2017-python | ||
| 2018-elixir | ||
| 2018-python | ||
| 2019-elixir | ||
| 2020-elixir | ||
| 2020-python | ||
| 2021-elixir | ||
| 2021-python | ||
| README.md | ||
Advent of Code 2015–
Here all solved puzzles for Advent of Code are kept for reference. Most solutions are written in Python, but there are also solutions written in Elixir.
- 2016–2020 are squashed in version control, so the original thoughts/rants about the solution are forgotten for future generations.
- 2021 onwards will have each solution as a separate commit.