AdventOfCode
My solutions for Advent of Code (by Eckankar)
Advent_of_Code2021
Solutions to Advent of COde 2021 (by cettt)
AdventOfCode | Advent_of_Code2021 | |
---|---|---|
2 | 12 | |
2 | 1 | |
- | - | |
8.3 | 0.0 | |
4 months ago | over 2 years ago | |
Haskell | R | |
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-21.
-
-🎄- 2021 Day 22 Solutions -🎄-
Code available on GitHub.
-
-🎄- 2021 Day 19 Solutions -🎄-
Code: https://github.com/Eckankar/AdventOfCode/tree/master/2021/19
Advent_of_Code2021
Posts with mentions or reviews of Advent_of_Code2021.
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 -🎄-
Then I wrote a small algorithm which finds the minimum and maximum values: no brute force needed- Full code with extra explanation on github.
-
-🎄- 2021 Day 23 Solutions -🎄-
My code is super slow: takes about 15 minutes for part 2. There is much too improve: will take a good look at this after the 25th.
-
-🎄- 2021 Day 22 Solutions -🎄-
My code is not yet as efficient as it could be: i takes about 4-5 seconds for both parts.
-
-🎄- 2021 Day 21 Solutions -🎄-
Today was my cheatday as I used the tidyverse library :) github
-
-🎄- 2021 Day 20 Solutions -🎄-
Today was quite easy again. The only challenging part in my input was that light pixels surrounded by only light pixels turn dark (and vice versa). github
-
-🎄- 2021 Day 19 Solutions -🎄-
For a while I didnt think I was going to make it :) But here I am :) github.
-
-🎄- 2021 Day 17 Solutions -🎄-
I first computed bounds and checked within a certain region of velocities. Compared with yesterday this was a piece of cake. I guess for must inputs the solution to part1 is simply y*(y+1)/2 where y is the absolute value of the lower bond - 1. github
-
-🎄- 2021 Day 16 Solutions -🎄-
Well save to say, this was my least favorite puzzle since 2018: and I still had a lot of fun :) I used two global variables: one keeping track of the current index and adding up the version numbers. I am praying that there won't be a follow up on this :D github
-
-🎄- 2021 Day 15 Solutions -🎄-
The full code is on github
-
-🎄- 2021 Day 14 Solutions -🎄-
cleaned up my code a little. Both parts run in 40ms. Full code with comments is on github
What are some alternatives?
When comparing AdventOfCode and Advent_of_Code2021 you can also consider the following projects:
AdventOfCode2021.jl - Advent of Code 2021 in Julia
adventofcode - My solutions for Advent of Code