AdventOfCode2021 VS aoc

Compare AdventOfCode2021 vs aoc and see what are their differences.

AdventOfCode2021

My solutions for the https://adventofcode.com/2021 challenge. (by Finomnis)

aoc

Advent of Code solutions in rust and go (by protiumx)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
AdventOfCode2021 aoc
4 4
1 2
- -
1.8 8.2
over 2 years ago 4 months ago
Rust Go
MIT License 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.

AdventOfCode2021

Posts with mentions or reviews of AdventOfCode2021. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-12-21.

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
    1 project | /r/adventofcode | 13 Dec 2022
    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 -πŸŽ„-
    248 projects | /r/adventofcode | 6 Dec 2022
    Go
  • -πŸŽ„- 2022 Day 5 Solutions -πŸŽ„-
    263 projects | /r/adventofcode | 4 Dec 2022
    Go solution abusing of slices
  • Advent of code: Rust, Go, and Binary operators
    2 projects | dev.to | 14 Dec 2021
    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 AdventOfCode2021 and aoc you can also consider the following projects:

Advent-of-Code - Advent of Code

advent-of-code-2021 - πŸŽ„ My Advent of Code solutions in Rust. http://adventofcode.com/2021

AdventOfCodeCSharp - My AoC Solutions

adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala

AdventOfCode2021.jl - Advent of Code 2021 in Julia

AOC2021 - Solutions for the Advent Of Code 2021

advent-of-code

advent-of-rust - πŸŽ„advent of code in rust πŸ¦€ (32%)

aoc2021 - Advent of Code 2021, this time in Go

advent_of_code_2021 - My solutions to the challenges from Advent of Code 2021

deno_aoc - πŸŽ„ Advent of code solutions written in TypeScript for Deno.

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: