aoc2021
advent_of_code
Our great sponsors
aoc2021 | advent_of_code | |
---|---|---|
3 | 19 | |
0 | 5 | |
- | - | |
0.0 | 8.0 | |
over 1 year ago | about 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 9 Solutions -π-
You donβt necessarily need to use recursion (which I also suck at implementing). Hereβs my iterative version: https://github.com/jslepicka/aoc2021/blob/master/9.py
- -π- 2021 Day 7 Solutions -π-
- -π- 2021 Day 6 Solutions -π-
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?
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
advent-of-code
AoC - my personal repo for the advent of code yearly challenge
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:
adventofcode - Solutions for problems from AdventOfCode.com
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Advent of code solutions
aoc2021 - Advent of Code 2021 Solutions
toit - Program your microcontrollers in a fast and robust high-level language.
AdventOfCode2021 - Advent of code 2021
adventofcode - Advent of Code Repo for Zach Attakk