AdventOfCode2021
Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree: (by AxlLind)
aoc2021
My solutions to Advent of Code 2021. (by ritobanrc)
Our great sponsors
AdventOfCode2021 | aoc2021 | |
---|---|---|
49 | 13 | |
61 | 0 | |
- | - | |
2.6 | 0.0 | |
3 months ago | almost 2 years ago | |
Rust | Rust | |
MIT License | 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.
AdventOfCode2021
Posts with mentions or reviews of AdventOfCode2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-29.
- [All years, all dates] Me after finishing all Advent of Code problems this year (my first year of AoC)
-
How to organize Rust code for Advent of Code puzzles?
I found this repository which solves the problem by having a src/main.rs file which basically calls cargo run --release {day} and parses the output to extract the time each day took, but I don't find this very satisfactory. I'd prefer to have everything compiled into the same executable, without having to run external commands.
- Prawda o Pracy
- O que Γ© o Advent Of Code?
- Give Me a Program to Code
-
What can i do to prepare for CS in uni ?
Try to do old advent of code https://adventofcode.com/2015 .. https://adventofcode.com/2021 there is 7 years worth of exercises. Try doing this upcoming one, but don't be discouraged if you cant keep up... If you manage to make the leader board at some point it might be your ticket to the US if that is something you want to do.
-
rust-analyzer VSCode extension only supports Cargo projects, and doesn't provide intellisense for single rust files
That's how I structured my solutions for Avent of Code in Rust, see here: https://github.com/AxlLind/AdventOfCode2021
-
[2021 Day 23 Part 1&2] Is this strategy feasible for computing programmatically the optimal cost?
My Rust solution runs in about 150ms, using just a standard Dijkstra implementation with nothing special like prioritizing moves like you propose.
-
[All years, all days] Finally got my 350th star βMostly in Rust, but also Python, Clojure, Haskell, and Ocaml!
2021 in Rust
- [2021 Day 24] A brute-force solution in 4.2 seconds
aoc2021
Posts with mentions or reviews of aoc2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-10.
-
-π- 2021 Day 11 Solutions -π-
Rust, not my proudest code, honestly quite messy, I couldn't decide whether to represent points as Vector2 or usizes into a vector, using both a HashSet for flashed but a Vec for to_flash feels silly, especially since it calls contains on both in the same condition, nor am I proud of the rightward drift resulting in five layers of braces, and the messy conditions on neighbor. But nonetheless, it works, and part 2 was easy enough to hack in on top of part 1, with a couple extra lines (albeit, still a bit messy, with a range 0..usize::MAX since bounded and unbounded ranges are different types, and an unreachable!() in the match statement at the end).
-
-π- 2021 Day 10 Solutions -π-
Rust. I found today surprisingly easy, much better than the last couple -- part 1 was quite simple, just keep a list of the open ones and close them as necessary. Part 2 should have been trivial to implement on top of that, but I wasn't correctly discarding the corrupted lines, and apparently sorting a list and finding the median without off-by-one errors is hard, so that took a while to debug.
-
-π- 2021 Day 8 Solutions -π-
Rust -- part 1 was fairly easy, but I had absolutely no clue how to do part 2 for a long time. I ended up just brute forcing it, trying every single possible wire re-arrangement (thanks itertools::permutations). I used a bitmask to represent which lights were on (no idea if its necessary), but it was a fun exercise trying to get the bit fiddling right -- I was pleasantly surprised when it just worked (ig that's the benefit of writing small, fairly self-contained routines). My initial answer for part 2 was also reversed (3535 instead of 5353), which is why there's a rev in there near the end. Overall, very fun challenge -- I enjoyed not knowing how to approach it initially, and I'm sure lots of people will have far more clever solutions.
-
-π- 2021 Day 7 Solutions -π-
Rust, basic bruteforce solution. Played around with trying to find an analytic solution for a couple mins, but ended up just brute forcing it, and surprisingly, its not absurdly slow.
-
-π- 2021 Day 6 Solutions -π-
Rust. Unsurprisingly, I did the naive thing for part 1 and then had to re-write for part 2. I'm happy with how clean part 2 is, I just used a Rust array for the counts -- though I'm sure there's a more clean solution for shifting an iterator.
-
Advent of Code rust nuggets
From u/ritobanrc (full solution): use nalgebra::Matrix5 and you can use column_iter() and row_iterator() on your board.
-
-π- 2021 Day 4 Solutions -π-
Rust -- Happy with how my code turned out for today. I used nalgebra's Matrix5 for storing the boards, which made checking for wins pretty easy.
-
-π- 2021 Day 2 Solutions -π-
Rust, nothing special here, not particularly fast (I initially thought aim should be a vector and lost some time because of it). The error handling could be a bit cleaner, I might fiddle with that for a bit so I don't have to put .unwraps and .expect and panic! everywhere.
-
-π- 2021 Day 1 Solutions -π-
Here's my solution without any collects: https://github.com/ritobanrc/aoc2021/blob/main/src/day01.rs -- but I don't think you could do it without itertools, since windows is only implemented for slices, and array_windows for iterators is still unstable (pending const-generics).
Rust, quite slow though, because the script I had to get the input automatically didn't use EST initially and I had to fix it, losing like 5 minutes. But was quite easy with Itertools::tuple_windows (though array_windows in std would have been even nicer, once that lands on stable).
What are some alternatives?
When comparing AdventOfCode2021 and aoc2021 you can also consider the following projects:
100-days-of-code - Fork this template for the 100 days journal - to keep yourself accountable (multiple languages available)
adventofcode - My solutions to the Advent of Code challenges
Advent-of-code - My solutions of adventofcode.com
AoC - my personal repo for the advent of code yearly challenge
advent-of-code - Advent Of Code Solutions
Advent-of-Code - Advent of Code
advent_of_code - Solutions to programming puzzles on Advent of Code
AdventOfCode2021.jl - Advent of Code 2021 in Julia
Advent_of_Code_2021_Solutions_Java - Personal AoC/2021 Solutions in Java
aoc2021 - Advent of code 2021 solutions, in varied languages
aoc2021 - Advent of Code 2021 Solutions
aoc - Advent of Code solutions