advent-of-code
aoc2020
advent-of-code | aoc2020 | |
---|---|---|
14 | 22 | |
70 | 29 | |
- | - | |
8.5 | 0.0 | |
5 months ago | about 1 year ago | |
JavaScript | Rust | |
MIT License | - |
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] Relevant XKCD: Game AIs
-
-🎄- 2021 Day 24 Solutions -🎄-
For a full write-up, see this repo, and for a non-annotated solution, see:
-
-🎄- 2021 Day 18 Solutions -🎄-
Otherwise, the main way I solved this was with a flat list of tokens rather than a truly nested structure. This was very similar to last year's Day 18, which I also solved in a similar manner.
-
-🎄- 2021 Day 9 Solutions -🎄-
Code can be found in this repo.
-
-🎄- 2021 Day 7 Solutions -🎄-
code
-
-🎄- 2021 Day 5 Solutions -🎄-
First 2D one! Got to reuse my InfiniteGrid class, which made this much easier.
-
How to beat AOC 2019, day 13, part 2?
Mine only took about 2 minutes when I originally recorded it. I've since added some optimizations to my Intcode computer, and re-running my original program with the optimized computer now runs in about 45 seconds. 😁
-
[2015 Day 19 (Part 2)] I don't want specifics, but can someone point me in which direction I should work this problem?
Here is my solution in JS, which also has a long comment explaining the main iterative loop.
-
[2020 - Day 15 - Part 1/2] [JS/Python] - Why is the Javascript solution so much faster?
Your solution is very similar to mine, and I too found that using an Array of a set size was way faster than an ordinary Object. I believe it has to resizing the array / object.
-
2020 Day 13 Solutions
Main code for part two here, with comments, and full code for all parts found here.
aoc2020
-
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.
-
[2020 Day 1] Performance comparison of solutions in 7 different languages
I benchmarked all 25 days in 4 languages (using GitHub Actions, which performs worse than my local dev setup, but feels more fair for reproducibility). Can't get any pretty animated output, though.
-
-🎄- 2020 Day 25 Solutions -🎄-
Rust
-
-🎄- 2020 Day 24 Solutions -🎄-
Kotlin
- [2020 Day 23 Part 2] [Haskell] Did anyone find a way to get decent performance without using a mutable data structure?
-
-🎄- 2020 Day 23 Solutions -🎄-
Rust
-
-🎄- 2020 Day 22 Solutions -🎄-
Rust
-
2020 Day 21 Solutions
Rust
-
2020 Day 20 Solutions
Rust
What are some alternatives?
AlgorithmProblems - Solutions to Algorithm Problems :chart_with_upwards_trend: :neckbeard:
AoC - my personal repo for the advent of code yearly challenge
adventOfCode - Solutions to the 'Advent of Code' (http://adventofcode.com) programming challenges in Elm
advent-of-code - My solutions for Advent of Code
adventofcode - Advent of code solution programs.
adventofcode - Solutions for Advent of Code over the years
adventofcode - Advent of Code solutions 2015-2023
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
advent-of-code - Advent of code solutions
aoc-2020 - My solutions for https://adventofcode.com
aoc2017apl - Advent of Code 2017 solutions in APL
hac - HAC Ada Compiler - a small, quick Ada compiler fully in Ada