AoC2021
Advent of Code 2021 (by EragonpeerGynt)
aoc2021
Advent of Code 2021 - my answers (by ephemient)
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-15.
-
Need help with code efficiency (day 15 AoC, part 1 and 2)
Disclaimer: I am learning Elixir this year trough AoC so code quality is in a shape that could find a place on r/programinghorror I would like to ask with help optimising algorithm I made for solving today's (day 15, 2021) Advent of Code problem. I implemented Dijkstra's (I think) and first part already need 35+ seconds to get the resautls. This is the code I made but I don't know how to optimize it (Maps probably aren't the most efficient thing to use in code that goes that far into recursion), to reach some more normal execution times. I would like to not use 3rd party/external libraries if possible, but any help is appriciated.
-
-🎄- 2021 Day 10 Solutions -🎄-
Elixir Quite a fun little exercise today. Code is still ugly as death, but I finally feal like I can enjoy the language freely. On other note, how could I solve the problem with me having to push char at the amstart of array without overloading process_line/2 ? (Line 5)
-
-🎄- 2021 Day 7 Solutions -🎄-
elixir Probably not very efficient and quite ugly. But it works... If anyone has any sugestions how to make it better (how to become better @elixir) i would greatly appriciate it
-
-🎄- 2021 Day 3 Solutions -🎄-
My solution in elixir (github link) It's not the cleanest fastest solution probably but does the job well enough. Still fighting with language a bit and forgeting some things in it sometimes (first time using it)
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 AoC2021 and aoc2021 you can also consider the following projects:
adventofcode - Solutions for problems from AdventOfCode.com
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adventofcode - Advent of code solutions
AoC - my personal repo for the advent of code yearly challenge
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
adventofcode - Advent of Code challenge solutions
advent-of-code - Advent of Code puzzles
roast - 🦋 Raku test suite
advent-of-code-2021
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