advent_of_code
advent-of-code
advent_of_code | advent-of-code | |
---|---|---|
19 | 25 | |
5 | 5 | |
- | - | |
8.0 | 8.0 | |
about 2 months ago | 4 months ago | |
Dart | Scala | |
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.
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.
advent-of-code
-
-🎄- 2022 Day 13 Solutions -🎄-
Scala using µJson. Really happy with how concise this is. I was able to parse everything into a Packet class that extends Ordered, which gives us the compare function. So once that was implemented recursively according to the rules we were given, I was able to jsut call .sorted for part 2.
-
-🎄- 2022 Day 12 Solutions -🎄-
Scala using jgrapht. I thought part 2 would require a different graph (similar to 2018 day 22) since the story said "to avoid needing to get out your climbing gear..." Glad that wasn't the case!
-
-🎄- 2022 Day 11 Solutions -🎄-
Scala. Pretty happy with how I parsed these into anonymous instances of my Monkey trait. For me part 2 wasn't hard because of the modulo trick, but because I was using mutable queues. So I had to add a reset() method to get things back the way they were before running part 2
-
-🎄- 2022 Day 10 Solutions -🎄-
Scala using tail recursion. Not the prettiest, but it works
-
-🎄- 2022 Day 9 Solutions -🎄-
Scala. Not too bad with my Point helper class. After part 1 I refactored the movements into a move helper that just takes 2 arbitrary points; the current point and the one we are moving towards. Then it was easy enough to just apply that in order each iteration for part 2.
-
-🎄- 2022 Day 8 Solutions -🎄-
Scala. It's ugly, but it works ¯\_(ツ)_/¯
-
-🎄- 2022 Day 5 Solutions -🎄-
Scala. Parsing wasn't as hard as I thought it would be using transpose and then just filtering non-alphanumeric characters. I initially parsed to a Map[Int, mutable.Stack[Char]] but then that bit me in part 2 when I would have to "reset" it (dang mutability!). So instead I parse to Map[Int, String] and just build the mutable stacks twice.
-
-🎄- 2022 Day 4 Solutions -🎄-
Updated version using sets instead of ranges
-
-🎄- 2022 Day 2 Solutions -🎄-
Scala. A little more verbose than I would like, but it works ¯\_(ツ)_/¯
-
-🎄- 2022 Day 1 Solutions -🎄-
Scala
What are some alternatives?
advent-of-code
AdventOfCodeHaskell - Advent of Code in Haskell
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:
advent-of-code
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code-rust - 🎄Starter template for solving Advent of Code in Rust.
adventofcode - Solutions for problems from AdventOfCode.com
advent-of-code-2022 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2022
toit - Program your microcontrollers in a fast and robust high-level language.
adventofcode - Advent of Code challenge solutions
adventofcode - Advent of Code Repo for Zach Attakk
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup