Advent-of-Code
adventofcode
Advent-of-Code | adventofcode | |
---|---|---|
4 | 12 | |
5 | 6 | |
- | - | |
6.9 | 4.7 | |
5 months ago | 5 months ago | |
Python | Python | |
MIT License | - |
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.
Advent-of-Code
-
[2022 day 14, part 2] I optimized my code to run 6000 times faster
For example, this was my solution for day 01 2021
-
-🎄- 2021 Day 19 Solutions -🎄-
To find the match, I created a Jupyter Notebook to visualize the points with the simple example. After staring 30 minutes into 3d charts, I finally figured out that whenever I find a rotation that matches, then there must be a vector v, which occures a lot of times when comparing each p1 from scanner 1 with each point p2 from scanner 2, because we only have to shift it by this vector to align with the scanner 0 (see jupyter notebook first plot).
-
-🎄- 2021 Day 13 Solutions -🎄-
Python 3, <1ms runtime
-
-🎄- 2021 Day 6 Solutions -🎄-
Python3
adventofcode
-
-🎄- 2021 Day 17 Solutions -🎄-
Python day 17 solution (GitHub). Not the fewest lines of code, but used dataclasses and modular functions to try improve readability -- I got very confused with keeping track of indices of velocities vs coordinates in other people's posted solutions. I find dataclasses in Python can be a great way to be descriptive about the quantities you are iterating
-
-🎄- 2021 Day 15 Solutions -🎄-
Python day 15 solution (GitHub) using Networkx for graph algorithm and Numpy for building the bigger grid. Solutions to other days available in this repo
-
-🎄- 2021 Day 14 Solutions -🎄-
Python day 14 solution (GitHub). Tried splitting out the logic into individual functions to aid readability.
-
-🎄- 2021 Day 13 Solutions -🎄-
Python day 13 solutions (GitHub). Using Dataclasses to improve readability
-
-🎄- 2021 Day 7 Solutions -🎄-
Python solution (GitHub) using Gauss formula for part 2
-
-🎄- 2021 Day 6 Solutions -🎄-
Python solution using deque (GitHub). Much faster than my first attempt, lol
-
-🎄- 2021 Day 5 Solutions -🎄-
Python day 5 solutions using Bresenham's algorithm (Github)
-
-🎄- 2021 Day 4 Solutions -🎄-
Python solution day 4 OOP (GitHub). Probably not the fewest lines of code but uses dataclasses and OOP to manage the states of each bingo card
-
-🎄- 2021 Day 2 Solutions -🎄-
Python day 2 solution (GitHub)
-
-🎄- 2021 Day 1 Solutions -🎄-
Python day 1 solution (GitHub) using numpy's convolve function for sliding window calc
What are some alternatives?
adventofcode2020 - Python solutions to https://adventofcode.com/2020
fp-ts - Functional programming in TypeScript
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
CSpydr - A static typed low-level compiled programming language inspired by Rust and C
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code - Advent Of Code Solutions
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:
AdventofCode2021
aoc-typescript
MoreLINQ - Extensions to LINQ to Objects
Advent-of-Code - C# solutions for Advent of Code puzzles
adventofcode - Advent of Code challenge solutions