Solutions to all 25 AoC 2020 problems in Rust! :christmas_tree: (by AxlLind)

Similar projects and alternatives to AdventOfCode2020
• ### aoc2020

learning python👨‍💻: my Advent of Code 2020 solutions

My solutions for Advent of Code

• ### aoc

🎄 My solutions and walkthroughs for Advent of Code (https://adventofcode.com) and more related stuff.

:christmas_tree: Advent of Code 2020: Solutions in Kotlin

• ### aoc-2020

Advent of code 2020 in Python and Rust

• ### aoc2020apl

Advent of Code 2020 solutions in Dyalog APL

My Solutions for Advent of Code 2020

My solutions to the Advent of Code, in Free Pascal

• ### aoc-2020-clojure

Advent of code 2020 solutions in Clojure

Done in boring old python

NOTE: The number of mentions on this list indicates mentions on common posts. Hence, a higher number means a better alternative or higher similarity.

## Posts

Posts where AdventOfCode2020 has been mentioned. We have used some of these posts to build our list of alternatives and similar projects - the last one was on 2021-01-26.
• [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
reddit.com/r/rust | 2020-12-24
• -🎄- 2020 Day 25 Solutions -🎄-
• Advent of Code 2020 - Day 24
reddit.com/r/rust | 2020-12-23
• -🎄- 2020 Day 24 Solutions -🎄-
• -🎄- 2020 Day 23 Solutions -🎄-
• 2020 Day 20 Solutions
• [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
reddit.com/r/rust | 2020-12-21
• -🎄- 2020 Day 22 Solutions -🎄-
• 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.
• Advent of Code 2020 - Day 21
reddit.com/r/rust | 2020-12-20
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.
reddit.com/r/rust | 2020-12-20