adventofcode
Advent of Code (http://adventofcode.com) solutions written in Python 3 (by viliampucik)
aoc21
By finalfire
adventofcode | aoc21 | |
---|---|---|
2 | 4 | |
31 | 0 | |
- | - | |
6.3 | 0.0 | |
5 months ago | over 2 years ago | |
Python | Rust | |
- | - |
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.
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-01.
-
-🎄- 2021 Day 2 Solutions -🎄-
Python 3 - Minimal readable solution for both parts [GitHub] import fileinput aim, h, d = 0, 0, 0 for l in fileinput.input(): cmd, x = l.strip().split(" ") x = int(x) if cmd == "down": aim += x elif cmd == "up": aim -= x else: h += x; d += aim * x # cmd == "forward" print(h * aim) print(h * d)
-
-🎄- 2021 Day 1 Solutions -🎄-
Python 3 - Minimal readable solution for both parts [GitHub]
aoc21
Posts with mentions or reviews of aoc21.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-02.
-
-🎄- 2021 Day 3 Solutions -🎄-
I only had time to look at today problem 10 minutes ago. Part 1 in Rust is here. I got a O(m*n) time complexity here (m is the number bitstring length, n is the number of bitstrings). I'm pretty sure there is a better way. Any insights?
-
-🎄- 2021 Day 2 Solutions -🎄-
Rust version with a single function. I wonder if at this line I can parse the integer value directly. I didn't find a way to do it yet.
-
-🎄- 2021 Day 1 Solutions -🎄-
Learning Rust, so there is my solution: https://github.com/finalfire/aoc21/blob/main/src/day1.rs
What are some alternatives?
When comparing adventofcode and aoc21 you can also consider the following projects:
advent-of-code - i know how to code now! here's my advent of code solutions that i can be somewhat proud of
toit - Program your microcontrollers in a fast and robust high-level language.
advent-of-code - Advent of Code, solved with Python, Rust, Magma, GAP
advent-of-code - My solutions for adventofcode.com
advent-of-code - Challenges for Advent of Code (https://adventofcode.com).
AdventOfCodeCSharp - My AoC Solutions
advent-of-code - My Advent of Code solutions through the years - mostly JS
Advent_of_Code - My Advent of Code solutions.
AdventOfCode - Solutions to Advent of Code
scryer-prolog - A modern Prolog implementation written mostly in Rust.
advent-of-code-2021
aoc2021