Advent-of-Code
A repository holding all of my solutions to Advent of Code problems (by Noble-Mushtak)
aoc
Advent of Code - mscha's Perl 6 solutions (by mscha)
Advent-of-Code | aoc | |
---|---|---|
9 | 22 | |
11 | 1 | |
- | - | |
7.9 | 9.0 | |
4 months ago | 4 months ago | |
Rust | Raku | |
- | MIT License |
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.
Advent-of-Code
Posts with mentions or reviews of Advent-of-Code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-18.
-
-🎄- 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!
aoc
Posts with mentions or reviews of aoc.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
- -❄️- 2023 Day 10 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
Full code at GitHub.
-
-❄️- 2023 Day 7 Solutions -❄️-
Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.
-
-🎄- 2022 Day 13 Solutions -🎄-
New version @GitHub.
-
-🎄- 2022 Day 12 Solutions -🎄-
So, a new version with a lot less almost-duplicate code @GitHub.
- -🎄- 2022 Day 2 Solutions -🎄-
-
-🎄- 2022 Day 1 Solutions -🎄-
@GitHub
-
-🎄- 2021 Day 21 Solutions -🎄-
Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.
-
-🎄- 2021 Day 20 Solutions -🎄-
The rest is the same as my first attempt, but full code at GitHub.
-
-🎄- 2021 Day 18 Solutions -🎄-
I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub
What are some alternatives?
When comparing Advent-of-Code and aoc you can also consider the following projects:
adventofcode2022
rockstar - The Rockstar programming language specification
advent_of_code_2022
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code-2022 - Advent of Code 2022 – Object-Oriented Solutions in Java: https://www.happycoders.eu/algorithms/advent-of-code-2022/
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
AdventOfCode
adventofcode - Advent of code solutions
aoc2022
advent-of-code-2021 - zig solutions to advent of code 2021
adventofcode - my solutions to advent of code
Advent-of-Code - Advent of Code
Advent-of-Code vs adventofcode2022
aoc vs rockstar
Advent-of-Code vs advent_of_code_2022
aoc vs advent-2021
Advent-of-Code vs advent-of-code-2022
aoc vs AdventOfCode
Advent-of-Code vs AdventOfCode
aoc vs adventofcode
Advent-of-Code vs aoc2022
aoc vs advent-of-code-2021
Advent-of-Code vs adventofcode
aoc vs Advent-of-Code