advent-of-code-2022
advent-of-code
advent-of-code-2022 | advent-of-code | |
---|---|---|
8 | 28 | |
0 | 7 | |
- | - | |
10.0 | 0.0 | |
over 1 year ago | over 1 year ago | |
D | Haskell | |
- | - |
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
advent-of-code
- -🎄- 2022 Day 16 Solutions -🎄-
- -🎄- 2022 Day 15 Solutions -🎄-
- -🎄- 2022 Day 14 Solutions -🎄-
- -🎄- 2022 Day 13 Solutions -🎄-
- -🎄- 2022 Day 12 Solutions -🎄-
- -🎄- 2022 Day 11 Solutions -🎄-
- -🎄- 2022 Day 10 Solutions -🎄-
- -🎄- 2022 Day 9 Solutions -🎄-
- -🎄- 2022 Day 8 Solutions -🎄-
- -🎄- 2022 Day 7 Solutions -🎄-
What are some alternatives?
aoc-2021 - AOC challenge in Haskell
ghc - Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing).
advent-of-code-2022 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2022
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
advent-of-code-2022-rust
AdventOfCode2022 - Repository for advent of code code to find solutions. This year in Go.
AdventOfCodeHaskell - Advent of Code in Haskell
advent-of-code
advent-of-code-2022 - actually publishing my solutions now that they're not redundant...
adventofcode - :christmas_tree: C#/.Net7 library for the Advent of Code problems
advent-of-code
advent-of-code-2022 - My solutions to the 2022 Advent of Code as shiny Jupyter notebooks. You can run and interact with the code and the solutions directly from your browser via Binder.