adventofcode
Some flavors of implementations for the Advent of Code challenges (by gansanay)
aoc
Advent of Code - mscha's Perl 6 solutions (by mscha)
adventofcode | aoc | |
---|---|---|
8 | 22 | |
0 | 1 | |
- | - | |
4.1 | 9.0 | |
over 2 years ago | 4 months ago | |
Python | Raku | |
MIT License | 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.
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 2021-12-12.
-
-🎄- 2021 Day 13 Solutions -🎄-
Python 3
-
-🎄- 2021 Day 12 Solutions -🎄-
Python 3, to be cleaned a bit
-
-🎄- 2021 Day 11 Solutions -🎄-
Python 3, nothing much to say. I'd like to find something nicer for applying patches like +1 to all adjacent positions...
-
[2021 day 8] a bit better than brute force, by filtering possible permutations based on input. What do you think?
As I wasn't really ready at 6am this morning to get into the segment-by-segment deduction, I went down a different route, link here.
-
-🎄- 2021 Day 8 Solutions -🎄-
Python 3, O(n log n) for part 2 if I am not mistaken
-
-🎄- 2021 Day 6 Solutions -🎄-
Python 3: a quite expected implementation for both parts, using a dict
-
-🎄- 2021 Day 4 Solutions -🎄-
Python 3
-
-🎄- 2021 Day 3 Solutions -🎄-
A Python solution I liked to write but still thinking there's an ultimately elegant way to do it.
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