advent_of_code_2021
Golang solutions to advent of code 2021 (by Stefansfrank)
| advent_of_code_2021_v2 | advent_of_code_2021 | |
|---|---|---|
| 4 | 8 | |
| 0 | 2 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | over 2 years ago | |
| Kotlin | Go | |
| - | - |
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_v2
Posts with mentions or reviews of advent_of_code_2021_v2.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-23.
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-23.
-
-🎄- 2021 Day 24 Solutions -🎄-
The solution is manual and well described here. I wrote an AOI simulator and some analysis code in this Go program analyzing the structure of the input and showing some sample simulations. The most interesting output is right at the beginning if you run it where it shows the (very few) differences that each digit's treatment shows - there is no way I would have found the manual solution without the info from that program.
-
-🎄- 2021 Day 22 Solutions -🎄-
I think my part 2 is one of the simplest solution I have seen so far and still runs decently fast (200 ms on my MB Pro) - even though there are many much faster on here.
-
2021 Day 21
My solution (Go) for part 2 does not use any cache (or Dynamic Programming - I am not trained in CS) and runs in 10 ms on a MacBook Pro and I doubt a cache would speed that up significantly.
-
-🎄- 2021 Day 21 Solutions -🎄-
Part1 was so simple that it's not worth talking much about it. My solution to Part2 is:
-
-🎄- 2021 Day 19 Solutions -🎄-
This solution solves the puzzle and is being well structured and readable. However, I gave up on my goal to make it fast - I had spend enough time on this that I just wanted to spend time on different things than code (heresy - I know). My only solution slower than a second this year so far (it's uh 35 sec on my MB pro)!
-
-🎄- 2021 Day 18 Solutions -🎄-
I am pretty satisfied with my solution to this problem even though there is some optimization potential left on the table - it solves the puzzle in 500 ms on my MB pro.
-
Speed observation in Go(lang)
Here is my final (faster) solution and the one with maps (I avoided mentioning the concrete algorithms in the post in order to avoid spoilers but it's in the comments there)
-
-🎄- 2021 Day 8 Solutions -🎄-
My code is NOT optimized for brevity but for a balance of execution speed and readability. As this is not a brute force solution, speed does not really matter - otherwise the manual statements mentioned in the beginning are most likely faster than my fingerprint comparison. It runs on my MacBook in 1.5 ms if I suppress the repeated text output that is in the Github version (3 ms with all the text output).