AoC2021
By SwampThingTom
Advent-of-Code
Advent of Code (by michaeljgallagher)
AoC2021 | Advent-of-Code | |
---|---|---|
7 | 42 | |
1 | 9 | |
- | - | |
3.6 | 8.6 | |
over 2 years ago | 4 months ago | |
Python | Python | |
- | - |
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.
AoC2021
Posts with mentions or reviews of AoC2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-21.
-
-🎄- 2021 Day 22 Solutions -🎄-
I used the same basic idea in my non-recursive solution. However mine is MUCH slower, probably because it requires a lot of list manipulation that isn't necessary in the recursive approach.
-
-🎄- 2021 Day 21 Solutions -🎄-
Part 2, on the other hand, was more much complicated. I noticed beforehand that it was unfeasible to simulate every last of the trillions of possibilities, that it was necessary to keep track of the win counters in some other form. But I could not figure out initially how to do it. I looked this thread for ideas, and managed to understand the strategy. Credits go to u/SwampThingTom for the idea ([this comment](SwampThingTom), and the code behind it). After understanding the approach, I implemented it on my code (instead of copy/pasting).
-
-🎄- 2021 Day 18 Solutions -🎄-
Python using a graph of nodes.
- -🎄- 2021 Day 11 Solutions -🎄-
-
-🎄- 2021 Day 7 Solutions -🎄-
Python
-
Unofficial AoC 2021 Participant Survey
Nothing other than this year's Advent of Code. Decided to use it for AoC as a way to see what I can do with it.
-
-🎄- 2021 Day 5 Solutions -🎄-
Day 5 - Hydrothermal Venture
Advent-of-Code
Posts with mentions or reviews of Advent-of-Code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-10.
-
-❄️- 2023 Day 11 Solutions -❄️-
Fun one :D
-
-❄️- 2023 Day 10 Solutions -❄️-
Way trickier than I was expecting
-
-❄️- 2023 Day 9 Solutions -❄️-
:D
-
-❄️- 2023 Day 8 Solutions -❄️-
Classic LCM
-
-❄️- 2023 Day 7 Solutions -❄️-
Who wants spaghetti?
-
-❄️- 2023 Day 6 Solutions -❄️-
Much easier than yesterday's :D
-
-🎄- 2022 Day 12 Solutions -🎄-
195/242
-
-🎄- 2022 Day 11 Solutions -🎄-
Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning
-
-🎄- 2022 Day 10 Solutions -🎄-
2343 / 2119
-
-🎄- 2022 Day 6 Solutions -🎄-
Impressive how fast everyone was with this one today