advent_of_code_2021
My solutions to the challenges from Advent of Code 2021 (by pierrechevalier83)
aoc
Advent of Code solutions in rust and go (by protiumx)
| advent_of_code_2021 | aoc | |
|---|---|---|
| 1 | 4 | |
| 2 | 2 | |
| - | - | |
| 4.7 | 8.2 | |
| over 2 years ago | 4 months ago | |
| Rust | Go | |
| - | 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.
advent_of_code_2021
Posts with mentions or reviews of advent_of_code_2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-11.
-
-🎄- 2021 Day 12 Solutions -🎄-
[Rust solution](https://github.com/pierrechevalier83/advent_of_code_2021/blob/main/src/day12.rs)
aoc
Posts with mentions or reviews of aoc.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-06.
-
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?
When comparing advent_of_code_2021 and aoc you can also consider the following projects:
rockstar - The Rockstar programming language specification
advent-of-code-2021 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2021
AdventOfCode2021 - My solutions for the https://adventofcode.com/2021 challenge.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AOC2021 - Solutions for the Advent Of Code 2021
advent-of-rust - 🎄advent of code in rust 🦀 (32%)
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: