advent-of-code-2021
Common lisp solutions to Advent of Code 2021 (by blake-watkins)
adventofcode
Advent of code solutions (by mathsaey)
Our great sponsors
advent-of-code-2021 | adventofcode | |
---|---|---|
4 | 55 | |
3 | 20 | |
- | - | |
0.0 | 7.8 | |
over 1 year ago | 4 months ago | |
Common Lisp | Elixir | |
GNU General Public License v3.0 only | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
advent-of-code-2021
Posts with mentions or reviews of advent-of-code-2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-14.
-
-🎄- 2021 Day 15 Solutions -🎄-
I assumed that you could only go right and down but got the wrong answer when I submitted for my input. Went back and actually read it properly and saw there was nothing about only right or down so rewrote it to use Dijkstra.
-
-🎄- 2021 Day 8 Solutions -🎄-
I made another solution (Common Lisp) which I like better than my original one, even though there's more code supporting it (https://github.com/blake-watkins/advent-of-code-2021/blob/main/day8.lisp). The essential functions are:
-
-🎄- 2021 Day 1 Solutions -🎄-
Common Lisp 365/3502
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
-
-❄️- 2023 Day 10 Solutions -❄️-
Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-