advent-of-code-2022
aoc2022
advent-of-code-2022 | aoc2022 | |
---|---|---|
8 | 27 | |
0 | 60 | |
- | - | |
10.0 | 0.0 | |
over 1 year ago | about 1 year ago | |
D | Rust | |
- | - |
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-2022
-
-🎄- 2022 Day 14 Solutions -🎄-
Slow dlang solution that simulates sand drops one grain at a time, one pixel at a time. Here's the main loop for part 2. The occupied[grain] = true assignment is due to the fact that the standard library doesn't have a hashset (to my knowledge), so instead I'm putting Points in an associative array while discarding the values.
-
-🎄- 2022 Day 13 Solutions -🎄-
Dlang solution, using JSON parsing from the standard library. At first I misunderstood the problem and kept getting failures in the second pair. I thought [2,3,4] vs [4] meant that the right list will run out of items after having successfully compared 2 and 4, but then I learned that this would only happen if 2 and 4 were equal (thanks to this thread). This made me realize that a binary comparison wasn't enough and pushed me to write the convoluted ternary comparison function below :
-
-🎄- 2022 Day 12 Solutions -🎄-
Dlang solution using BFS. Relevant part :
-
-🎄- 2022 Day 11 Solutions -🎄-
Dlang solution as usual, here's the class that handles monkey business :
-
-🎄- 2022 Day 10 Solutions -🎄-
Dlang solution. For part 2 I initially thought that the X register contains values exceeding 40, so I kept appending pixels to the CRT while comparing them to the sprite, and in the end I printed the string in chunks of 40. Only later did I realize my mistake
-
-🎄- 2022 Day 9 Solutions -🎄-
Dlang bruteforce solution. For some reason I thought the rope was 9 knots long and kept getting off by one results. Relevant part 2 portion :
-
-🎄- 2022 Day 8 Solutions -🎄-
Dlang bruteforce solution
-
-🎄- 2022 Day 7 Solutions -🎄-
Dlang solution, part 2. I'm embarrassed by this code but I'm sharing it because it took a lot of effort to write it. Previous solutions are available in this repo
aoc2022
-
I moved all my input files to a private repo and used it as a submodule
Locally, I use a script to retrieve any new inputs.
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-
- -🎄- 2022 Day 17 Solutions -🎄-
What are some alternatives?
AoC-2022 - Advent of code 2022
Advent-Of-Code-2022 - AoC Solutions in Idris
advent-of-code-2022 - 🎄 Solutions to Advent of Code 2022 in C++
aoc-22 - Here are my solutions for the Advent of Code 2022
advent-of-code - Advent of code (currently with python 3.11)
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
noulith - *slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it
AoC - my personal repo for the advent of code yearly challenge
adventofcode - My solutions to the Advent of Code challenges
adventofcode - My solutions for https://adventofcode.com/ programming mini puzzles - written mostly as sjasmplus script (to exercise the tool and collect ideas for future development of the script language, not because it's a best choice for the task, quite opposite)
aoc_2022
haskell - My Haskell Learning (mostly AOC)