AdventOfCode
aoc2021
AdventOfCode | aoc2021 | |
---|---|---|
4 | 32 | |
14 | 26 | |
- | - | |
8.2 | 0.0 | |
4 months ago | about 1 year ago | |
R | Kotlin | |
- | - |
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
-
-🎄- 2021 Day 24 Solutions -🎄-
Solution First solved this in Excel. Here'a snapshot of the mess. After doing it once, writing code to do it for any input turned out to be surprisingly much easier than I had hoped for.
-
-🎄- 2021 Day 3 Solutions -🎄-
Solution read as a fixed width file, so that all digits became a separate column. After that it was simple column operations.
-
Anyone doing the advent of code?
I did it last year, was a great learning experience and tons of fun seeing everyone else's solutions. Am doing it again this year too. I plan on posting solutions to the thread and Github
-
-🎄- 2021 Day 1 Solutions -🎄-
Solution
aoc2021
-
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?
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
AoC - my personal repo for the advent of code yearly challenge
adventofcode - Solutions for problems from AdventOfCode.com
adventofcode - Advent of Code challenge solutions
aoc - Advent of Code solutions
roast - 🦋 Raku test suite
adventofcode - My solutions to the Advent of Code challenges
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
AdventOfCode2021.jl - Advent of Code 2021 in Julia
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022