Our great sponsors
advent21 | aoc2021 | |
---|---|---|
2 | 19 | |
0 | 15 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | about 2 years ago | |
Nim | Python | |
Apache License 2.0 | 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 2022-12-06.
-
Me: "I'm going to learn rust for Advent of code!" Also me:
To be fair, compared to other years, only Elixir (last year) was more frustrating to learn than Rust (such that it does look like the picture above, due to many prototypes and all visualisation code being written in Python). I used Kotlin in 2020 and did Go for 2018 (though I didn't participate in that one live). I'm using C# this year, and all of these were simple enough that I didn't need to spend more time learning how to do things than actually doing them.
-
-🎄- 2021 Day 25 Solutions -🎄-
Plus Python visualisation
-
-🎄- 2021 Day 24 Solutions -🎄-
Python only today.
-
-🎄- 2021 Day 23 Solutions -🎄-
Elixir
-
[2021 Day 22][Pygame] The Cube(s)
Source
-
-🎄- 2021 Day 22 Solutions -🎄-
Elixir, Python 1708/791
-
-🎄- 2021 Day 21 Solutions -🎄-
Elixir, 167 ms on Part 2.
- -🎄- 2021 Day 20 Solutions -🎄-
-
-🎄- 2021 Day 18 Solutions -🎄-
Elixir 934/972 ; 5ms/100ms
-
[2021 Day 17][Pygame] Parabolic Probe Problem
Source
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.
advent-of-code
Advent-Of-Code - My solutions to all Advent of Code questions
BenchmarkDotNet - Powerful .NET library for benchmarking
aoc2021 - My Advent of Code 2021 solutions, in Rust.
AdventOfCode2022 - https://adventofcode.com/2022
adventofcode - My solutions for Advent of Code
aoc
adventofcode - ES6 solutions to Advent of Code puzzles.
aoc2018 - Advent of Code 2018 (Go)
adventofcode - Advent of Code challenge solutions
aoc-2021-rust - Advent of Code 2021 in Rust