Our great sponsors
| advent21 | aoc2021 | |
|---|---|---|
| 2 | 18 | |
| 0 | 16 | |
| - | - | |
| 0.0 | 1.8 | |
| over 2 years ago | over 2 years ago | |
| Nim | Go | |
| Apache License 2.0 | - |
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.
advent21
Posts with mentions or reviews of advent21.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-22.
-
Help regarding 2021 Day 19
You can try to read my walkthrough... You cannot just match one edge to another edge, as there may be match in magnitude but are in fact totally off. You have to test for all edges, and you'll eventually know if two scanners line up if there's more than just two 'lucky' points (i.e. edge) that exists for both scanners.
-
-🎄- 2021 Day 23 Solutions -🎄-
Nim with my walkthrough here. Similar to the other solutions, just brute-forcing all possible moves for Dijkstra's algorithm. My walkthrough simply explains how to figure out the valid moves to do so, turns out it isn't too hard after having written it down (and simplifying my code).
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-23.
- -🎄- 2021 Day 24 Solutions -🎄-
-
-🎄- 2021 Day 23 Solutions -🎄-
(Here's my original version that used the uint64 encoding: https://github.com/danvk/aoc2021/blob/e795c78090c35c0b9880fd692ba1677fae31e044/day23/day23.go)
- -🎄- 2021 Day 22 Solutions -🎄-
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
-
-🎄- 2021 Day 18 Solutions -🎄-
Here's my previous solution, which didn't use any mutation: https://github.com/danvk/aoc2021/blob/92b5352806e0e854ebc36e6c9804dc13b5262349/day18/day18.go
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 14 Solutions -🎄-
- -🎄- 2021 Day 13 Solutions -🎄-
What are some alternatives?
When comparing advent21 and aoc2021 you can also consider the following projects:
Red-Team-Advent-of-Code - Red Teaming / Pentesting challenges for my Advent-Of-Code 2021.
roast - 🦋 Raku test suite
Advent-Of-Code - My solutions to all Advent of Code questions
adventofcode - Advent of Code challenge solutions
aoc2021 - My Advent of Code 2021 solutions, in Rust.
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
adventofcode - My solutions for Advent of Code
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
adventofcode - ES6 solutions to Advent of Code puzzles.
aoc2021 - Advent of Code 2021 - my answers
aoc-2021-in-kotlin