Advent-of-Code
advent_of_code_2022
Advent-of-Code | advent_of_code_2022 | |
---|---|---|
9 | 1 | |
11 | 0 | |
- | - | |
7.9 | 10.0 | |
4 months ago | over 1 year ago | |
Rust | 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 Day 19 Solutions -🎄-
Python 3, 6/13, code here
-
-🎄- 2022 Day 16 Solutions -🎄-
Python 3 (to process the input) and C++ (to actually solve the problem), 81/143, view code here
-
-🎄- 2022 Day 13 Solutions -🎄-
Python 3, 27/22: Here is my Part 1 and Part 2 code.
-
-🎄- 2022 Day 10 Solutions -🎄-
Python 3, 28th on star 1 and 29th on star 2, both parts are <=20 lines of code. Main thing which is notable is that I used "\u2588" instead of # symbols and spaces instead of periods, made the capital letters much easier to read. I also have my solutions in this GitHub repo.
-
Everyone is overcomplicating day 22 ???
I also used coordinate compression, but had a slightly different take: Keep a 3D boolean array representing whether each points in our compressed space of points is turned on or off. And then for each instruction, just go through all the points affected by that instruction and set their state to true if the instruction is "on" or false if the instruction is "off". This approach runs in about 2 seconds in Scala, and honestly, I'm not sure that the complex cube intersection approach runs faster than this coordinate compression approach, although it would be nice to see a cube intersection approach written in Scala so we can compare apples to apples.
-
-🎄- 2021 Day 20 Solutions -🎄-
Python 3.8.10 82/68
-
Is anyone doing the whole 2021 advent in Haskell?
Not sure if you are interested in solutions from past years, but I did Haskell for AoC 2019, although I'm not the best Haskell programmer so some of it is not that well designed. If you're interested, feel free to take a look at my solutions.
-
[2021 Day #14 (part 2)] (extend) Exponentially harder
I've posted my solution to GitHub here. (It's written in Scala because I am trying to use Advent of Code to learn Scala, but it's probably not idiomatic Scala so if you have any tips/suggestions for improvement, let me know!) When I tested this on the sample, Part 1 took about 20 seconds, part 2 took about 27 seconds, and the extension took about 135 seconds. So this isn't a very good solution, but going from 40 steps to 1000000000 steps gave us only a 5-times factor speed-up, which is evidence that the time complexity of the algorithm is not growing linearly in the number of steps.
-
[2021 Day 7] Applying Slope Trick from Competitive Programming
If you'd like to see my full Scala solution, you can find it on my GitHub here. Have fun, and thanks for reading!
advent_of_code_2022
What are some alternatives?
adventofcode2022
good_lp - Linear Programming for Rust, with a user-friendly API. This crate allows modeling LP problems, and lets you solve them with various solvers.
advent_of_code_2022
adventofcode - Advent of code solutions
advent-of-code-2022 - Advent of Code 2022 – Object-Oriented Solutions in Java: https://www.happycoders.eu/algorithms/advent-of-code-2022/
advent-of-code - My Advent of Code submissions. For 2021 and before, these are the original code I used, without any modifications after-the-fact. As such, they are probably not as efficient or short as they should be, because I want a working solution faster, not a better solution. For 2022 and after, these are the solutions uploaded to my YouTube channel.
AdventOfCode
rayon - Rayon: A data parallelism library for Rust
aoc2022
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
adventofcode - my solutions to advent of code
adventofcode - Advent of Code solutions