aoc
advent-2021
aoc | advent-2021 | |
---|---|---|
5 | 19 | |
26 | 5 | |
- | - | |
7.5 | 6.8 | |
4 months ago | over 1 year ago | |
Python | Rust | |
- | - |
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.
aoc
-
-🎄- 2021 Day 24 Solutions -🎄-
Python "Precompiled solution" featured on github
-
-🎄- 2021 Day 12 Solutions -🎄-
I think there's no faster algorithm, but I think you can improve the execution time by reducing the number of comparisons you do. Check out my solution.
-
Advent of Code 2021 Python Solution: Day 8
First part was very easy but for the second part, I took little help from here.
-
-🎄- 2021 Day 8 Solutions -🎄-
Python 505/180 featured on github
-
-🎄- 2020 Day 24 Solutions -🎄-
python
advent-2021
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
-
-🎄- 2021 Day 22 Solutions -🎄-
Rust https://github.com/Crazytieguy/advent-2021/blob/master/src/bin/day22/main.rs Imagining the geometry of this was very tricky for me. For a while I contemplated if calculating the intersection of each pair of cuboids would give me enough information to know how many cubes are on at the end, and finally decided that I would also have to calculate the intersections of those and so on, so I gave up. Instead I decided that my state will be a vector of cuboids that are garuanteed to be non overlapping, and on each command I would subtract the current cuboid from each of these non overlapping cuboids (leaving 1 to 6 cuboids depending on intersection), and finally either add in the current cuboid (for on command) or leave it out (for off).
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 14 Solutions -🎄-
What are some alternatives?
aoc-mgz - Age of Empires II recorded game parsing and summarization in Python 3.
aoc2021 - Advent of Code 2021 - my answers
perlweeklychallenge-club - Knowledge base for The Weekly Challenge club members using Perl, Raku, Ada, APL, Awk, Bash, BASIC, Bc, Befunge-93, Bourne Shell, BQN, Brainfuck, C3, C, CESIL, C++, C#, Clojure, COBOL, Coconut, Crystal, D, Dart, Dc, Elm, Emacs Lisp, Erlang, Excel VBA, Fennel, Fish, Forth, Fortran, Gembase, GNAT, Go, Haskell, Haxe, HTML, Idris, IO, J, Janet, Java, JavaScript, Julia, Kotlin, Lisp, Lua, M4, Miranda, Modula 3, MMIX, Mumps, Myrddin, Nim, Nix, Node.js, Nuweb, OCaml, Odin, Ook, Pascal, PHP, Python, Postscript, Prolog, R, Ring, Ruby, Rust, Scala, Scheme, Sed, Smalltalk, SQL, Swift, Tcl, TypeScript, Visual BASIC, WebAssembly, Wolfram, XSLT and Zig.
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
advent-2020-kotlin - :christmas_tree: Advent of Code 2020: Solutions in Kotlin
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
code-challenges - My solutions to various code challenges
deno_aoc - 🎄 Advent of code solutions written in TypeScript for Deno.
advent-of-code
aoc - Advent of Code - mscha's Perl 6 solutions
scamp-cpu - A homebrew 16-bit CPU with a homebrew Unix-like-ish operating system.
AdventOfCode2021.jl - Advent of Code 2021 in Julia