AdventOfCode2020 Alternatives
-
aoc2020
Advent of Code 2020 - my answers
-
advent-of-code-2020-python
learning python👨💻: my Advent of Code 2020 solutions
-
advent-of-code
My solutions for Advent of Code
-
aoc
🎄 My solutions and walkthroughs for Advent of Code (https://adventofcode.com) and more related stuff.
-
advent-2020-kotlin
:christmas_tree: Advent of Code 2020: Solutions in Kotlin
-
advent-of-code-2020-rust
-
advent_of_code
-
adventOfCode
Solutions to the 'Advent of Code' (http://adventofcode.com) programming challenges in Elm
-
aoc2020
-
aoc20
-
aoc-2020
Advent of code 2020 in Python and Rust
-
advent-of-code-2020
-
AdventOfCode
My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
-
aoc2020apl
Advent of Code 2020 solutions in Dyalog APL
-
advent2020
Advent of Code 2020
-
Advent-2020
My Solutions for Advent of Code 2020
-
Advent_of_Code_in_Pascal
My solutions to the Advent of Code, in Free Pascal
-
aoc-2020-clojure
Advent of code 2020 solutions in Clojure
-
advent-of-code-2020
Done in boring old python
-
advent-of-code
Posts
-
[2020 Day 9] Part 2 - What is the most efficient algorithm?
One important thing to note is that all numbers in the input are positive. Since they are all positive it can be solved quite easily in linear time, O(n), and O(1) memory complexity. See algorithm here. I used this algorithm in my Rust solution.
-
Advent of Code 2020 - Final Day: 25
Link to solution (346/284)
-
-🎄- 2020 Day 25 Solutions -🎄-
Link to solution (346/284)
-
Advent of Code 2020 - Day 24
Link to solution (992/628)
-
-🎄- 2020 Day 24 Solutions -🎄-
Link to solution (992/628)
-
-🎄- 2020 Day 23 Solutions -🎄-
Link to solution (1180/560)
-
2020 Day 20 Solutions
Link to solution (359/116)
-
[2020, Day 22, Part 2] Is there a way to speed up the state checking?
A solution that will work with very high probability (which I used here) is to store a hashset of hashes, HashSet. E.g you compute a hash for the two queues and see if that hash has already been seen. There is a very, very, small probability of a hash collision, but in practice this works.
-
Advent of Code 2020 - Day 22
Link to solution (471/281)
-
-🎄- 2020 Day 22 Solutions -🎄-
Link to solution (471/281)
-
2020 Day 21 Solutions
For part one, I compute the intersection of ingredients between all lists containing a certain allergen. Then it was the same process as day 16, whereby you eliminate possibilities by iteratively looking at what allergen only has one possible ingredient it can be. Once again, this leads to a unique solution in our input.
Link to solution (1323/898)
-
Advent of Code 2020 - Day 21
For part one, I compute the intersection of ingredients between all lists containing a certain allergen. Then it was the same process as day 16, whereby you eliminate possibilities by iteratively looking at what allergen only has one possible ingredient it can be. Once again, this leads to a unique solution in our input.
Link to solution (1323/898)
Stats
AxlLind/AdventOfCode2020 is an open source project licensed under MIT License which is an OSI approved license.