advent-of-code-2021
aoc
Our great sponsors
advent-of-code-2021 | aoc | |
---|---|---|
14 | 4 | |
240 | 2 | |
- | - | |
2.6 | 8.2 | |
5 months ago | 4 months ago | |
Rust | Go | |
GNU General Public License v3.0 only | 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-2021
-
Demystifying bitwise operations, a gentle C tutorial
Some very interesting advent of code contributions written in Rust, available on github, use bitwise operations. Shout out to Tim Visee! https://github.com/timvisee/advent-of-code-2021/blob/master/...
-
Bugs that the Rust compiler catches for you
This may be the closest thing I've personally seen: https://github.com/timvisee/advent-of-code-2021
-
-π- 2021 Day 16 Solutions -π-
Part 2 0.022ms (22ΞΌs)
-
-π- 2021 Day 15 Solutions -π-
Part 1 1.05ms
- [2021 Day 12 Part 2] Has somebody found a sub 1s solution for part 2?
-
-π- 2021 Day 12 Solutions -π-
Part 1 0.861ms (861ΞΌs)
-
-π- 2021 Day 11 Solutions -π-
See https://github.com/timvisee/advent-of-code-2021/blob/master/runner/src/bin/bench.rs
- [2021 Day 9] Part 1 - 48 min to get it to work. I should go back to Python for these
-
-π- 2021 Day 6 Solutions -π-
Part 1 0.0027ms (2.7ΞΌs)
-
-π- 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
aoc
-
Y'all are getting way too excited
Using Dijkstra and starting from `z` the solution was 2x faster than BFS in my case. By starting from `z` it constraint is that you can go to a neighbor only if the height difference is 1, that is faster than starting from `a`. For the priority I used that the amount of steps from the start to the current node inspected, meaning the nodes with shortest paths are inspected first. I counted the number of cycles (each time an element is popped out the queue) For part 1 I get ~5000 cycles with Dijkstra and ~8000 with BFS. Cannot see if there is something wrong with my BFS implementation Solution in Go
-
-π- 2022 Day 7 Solutions -π-
Go
-
-π- 2022 Day 5 Solutions -π-
Go solution abusing of slices
-
Advent of code: Rust, Go, and Binary operators
Hi everyone, I got late into the advent of code problems and currently I'm solving day 3 and 4. I've been writing my solutions in rust and go (see my aoc repo), and today, while solving day 03 I came across with an interesting comparison between rust and go code that I'd like to share in this post.
What are some alternatives?
adventlang - π A programming language (+ code playground) for Advent of Code.
AdventOfCode2021 - My solutions for the https://adventofcode.com/2021 challenge.
Advent_of_Code - My Advent of Code solutions.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc2020 - Advent of Code 2020
AOC2021 - Solutions for the Advent Of Code 2021
advents-of-code - ππ Solutions for the yearly advent of code challenges
advent-of-rust - πadvent of code in rust π¦ (32%)
advent-of-code-rust - My solutions to Advent Of Code
advent_of_code_2021 - My solutions to the challenges from Advent of Code 2021
public
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: