Advent_of_Code2021
Solutions to Advent of COde 2021 (by cettt)
aoc2021
Advent of Code 2021 - my answers (by ephemient)
Advent_of_Code2021 | aoc2021 | |
---|---|---|
12 | 32 | |
1 | 26 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | about 1 year ago | |
R | Kotlin | |
- | - |
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_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
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 2022-02-04.
-
All years, all days, everything in Haskell
I've done every year in Haskell (2015 2016 2017 2018 2019 2020 2021), and so have several other people such as /u/glguy. I don't see if /u/mstksg has anything published for 2015 but they've done 2016 2017 2018 2019 2020 2021 along with some pretty good writeups, I recommend checking those out.
-
Jetbrains looks like it's about to release Compose ui for ios, and web!
I ran my own benchmarks for a whole ton of code at https://github.com/ephemient/aoc2021 on both Linux x64 and macos x64, and ended up disabling Kotlin/Native because it was varying between 10x and 100x slower than Kotlin/JVM, eventually timing out on CI. The generated code may be reasonable thanks to LLVM, but the runtime certainly is not.
-
-🎄- 2021 Day 25 Solutions -🎄-
Took a while for me to get around to completing this in Kotlin, Python, and Rust as well, since I was working on optimizing other solutions, but I finally made it.
-
-🎄- 2021 Day 24 Solutions -🎄-
So I switched tacks and implemented this in Kotlin, where mutation is easier. First version was brute-force with duplicate state avoidance (checked before the state explosion at every input), which worked quickly enough for part 1, but ran into OOMs for part 2. Once I replaced the HashSet with a custom LruSet (and later a simpler CacheSet which simply overwrites on hash collisions) it ran part 2 in a few minutes. I then ported this into Haskell.
-
-🎄- 2021 Day 23 Solutions -🎄-
Haskell 1171/339
-
-🎄- 2021 Day 22 Solutions -🎄-
Kotlin, Python, and Rust solutions are the same solution but much uglier.
-
-🎄- 2021 Day 21 Solutions -🎄-
I'm doing the same cached recursion in Kotlin, Python, and Rust.
-
-🎄- 2021 Day 20 Solutions -🎄-
Haskell 621/603
-
-🎄- 2021 Day 19 Solutions -🎄-
Haskell 258/240
-
-🎄- 2021 Day 18 Solutions -🎄-
Haskell Kotlin 622/1185
What are some alternatives?
When comparing Advent_of_Code2021 and aoc2021 you can also consider the following projects:
adventofcode - My solutions for Advent of Code
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code - Advent of Code
AoC - my personal repo for the advent of code yearly challenge
adventOfCode - Advent of Code solutions in a number of different languages
adventofcode - Advent of Code challenge solutions
AdventOfCode - My solutions for Advent of Code
roast - 🦋 Raku test suite
advent2021
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
Advent_of_Code2021 vs adventofcode
aoc2021 vs adventofcode
Advent_of_Code2021 vs advent-of-code
aoc2021 vs AoC
Advent_of_Code2021 vs adventOfCode
aoc2021 vs adventofcode
Advent_of_Code2021 vs AdventOfCode
aoc2021 vs roast
Advent_of_Code2021 vs advent2021
aoc2021 vs advent-2021
Advent_of_Code2021 vs AoC
aoc2021 vs advent-of-code-go