advent-of-code-2021
advent of code 2021 solutions (by simorautiainen)
aoc
Advent of Code - mscha's Perl 6 solutions (by mscha)
advent-of-code-2021 | aoc | |
---|---|---|
4 | 22 | |
0 | 1 | |
- | - | |
4.2 | 9.0 | |
over 2 years ago | 4 months ago | |
Python | Raku | |
- | MIT License |
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-11.
-
-🎄- 2021 Day 12 Solutions -🎄-
Python solution. If you look at the input you might notice that there is not a single path from uppercase cave to uppercase cave, so with recursion there is no way code can get stuck. It also means that you don't need to keep track of the finished paths because there is no way to generate duplicates.
-
-🎄- 2021 Day 11 Solutions -🎄-
I did with recursion too, but to make a point flash it must have exactly value 10. So I just need to edit all numbers that have value over 9 to a zero at the end. Don't know if its any faster :D My Python solution using external library Numpy
-
-🎄- 2021 Day 6 Solutions -🎄-
Python 3 Got my solution running in less than 1ms using Counters
-
-🎄- 2021 Day 4 Solutions -🎄-
PYTHON. I did first version without Numpy but decided that its way too useful so I did some refactoring and below is my solution. It's a bit slow so not the most optimal.
aoc
Posts with mentions or reviews of aoc.
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 -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
Full code at GitHub.
-
-❄️- 2023 Day 7 Solutions -❄️-
Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.
-
-🎄- 2022 Day 13 Solutions -🎄-
New version @GitHub.
-
-🎄- 2022 Day 12 Solutions -🎄-
So, a new version with a lot less almost-duplicate code @GitHub.
- -🎄- 2022 Day 2 Solutions -🎄-
-
-🎄- 2022 Day 1 Solutions -🎄-
@GitHub
-
-🎄- 2021 Day 21 Solutions -🎄-
Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.
-
-🎄- 2021 Day 20 Solutions -🎄-
The rest is the same as my first attempt, but full code at GitHub.
-
-🎄- 2021 Day 18 Solutions -🎄-
I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub