aoc2021
advent_of_code
aoc2021 | advent_of_code | |
---|---|---|
4 | 19 | |
1 | 5 | |
- | - | |
1.8 | 8.0 | |
over 2 years ago | 2 months ago | |
Rust | Dart | |
- | GNU General Public License v3.0 only |
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.
aoc2021
- -🎄- 2021 Day 11 Solutions -🎄-
-
-🎄- 2021 Day 5 Solutions -🎄-
The orientation calculation could be done by matrix indexes operations https://github.com/FlakM/aoc2021/blob/main/day5/task1/src/main.rs and then its easier to create ranges. You can also use some clever crates and get some calculations for free https://github.com/timvisee/advent-of-code-2021/blob/master/day05b/src/main.rs
-
Looking for feedback on my Rust Advent of Code solutions
I wonder if this is based on scala background but my solutions are similar https://github.com/FlakM/aoc2021 I didn't even consider to just have mutable variables and iterate over inputs like probably most of the other rusteacians. Maybe it's due to scala's enums PTSD...
-
-🎄- 2021 Day 2 Solutions -🎄-
Here are my solutions in rust task 1 and task 2. I didn't really strive for completion speed but second task was done in like 5 seconds due to code from first task being structured in reusable way. Also learning vim with coc and rust analyzer and GOD DAMN this is cool! (got some dotfiles if you want) <3 Spent most time fighting with router plugin not to change working directory, for some reason it tripped poor ls.
advent_of_code
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.
What are some alternatives?
Advent-of-Code - Advent of Code
advent-of-code
adventofcode - adventofcode.com solutions
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:
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Solutions for problems from AdventOfCode.com
toit - Program your microcontrollers in a fast and robust high-level language.
adventofcode - Advent of Code Repo for Zach Attakk
advent-of-code - Advent Of Code Solutions
advent-of-code-2021
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala