aoc2021
advent_of_code
aoc2021 | advent_of_code | |
---|---|---|
8 | 19 | |
0 | 5 | |
- | - | |
0.0 | 8.0 | |
about 2 years ago | 2 months ago | |
Python | Dart | |
- | GNU General Public License v3.0 only |
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.
aoc2021
-
-🎄- 2021 Day 10 Solutions -🎄-
My solution in Python, using a stack to keep track of my needs for closure.
-
-🎄- 2021 Day 8 Solutions -🎄-
My solution in python.
-
-🎄- 2021 Day 7 Solutions -🎄-
My solution in python. Brute force, nothing fancy, using the closed formula for the sum of integers less than n.
-
-🎄- 2021 Day 6 Solutions -🎄-
My solution in python, partitioning the population by day until reproduction, and keeping track of the group dynamics through time.
-
-🎄- 2021 Day 5 Solutions -🎄-
My solution in Python. Nothing to boast about: lazy brute force, if that makes any sense. The optional dependency on tqdm helped muster patience.
-
-🎄- 2021 Day 4 Solutions -🎄-
My solution in Python, using a stateful approach that amounts to object-oriented programming.
-
-🎄- 2021 Day 2 Solutions -🎄-
My solution in Python, using list reduction and declarative specification of moves.
-
-🎄- 2021 Day 1 Solutions -🎄-
My solution in Python, using boolean sums.
advent_of_code
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.
What are some alternatives?
aoc2021 - Advent of Code 2021
advent-of-code
AOC - 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:
aoc - Advent of Code 2021 in Solidity and JS
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code-2021 - Advent of Code 2021 Submissions
adventofcode - Solutions for problems from AdventOfCode.com
AdventOfCode2021
toit - Program your microcontrollers in a fast and robust high-level language.
AoC - my personal repo for the advent of code yearly challenge
adventofcode - Advent of Code Repo for Zach Attakk