AdventOfCode2022
advent_of_code
AdventOfCode2022 | advent_of_code | |
---|---|---|
3 | 19 | |
0 | 5 | |
- | - | |
10.0 | 8.0 | |
over 1 year ago | 2 months ago | |
Java | 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.
AdventOfCode2022
-
HELP [2022 Day 11 (Part II)][Java] Implemented Number reducing, works only on test data
I guess the Unit tests didn't catch this because they isolate the state between each @Test Method (JUnit). I parse the initial monkey list state at the start of the method instead of once per Day now: https://github.com/Mattizin/AdventOfCode2022/commit/989e3a7e495f522911edc35aea8eb89d1b8e10fc
-
-π- 2022 Day 9 Solutions -π-
Java Github Commit
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
advent-of-code
advent-of-code - My solutions for the Advent of Code
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 - Hacky solutions for lovely problems
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - adventofcode.com solutions
adventofcode - Solutions for problems from AdventOfCode.com
AOC - Advent of Code
toit - Program your microcontrollers in a fast and robust high-level language.
advents-of-code - ππ Solutions for the yearly advent of code challenges
adventofcode - Advent of Code Repo for Zach Attakk