adventofcode
Advent of code solutions (by mathsaey)
advent-of-code
My solutions to the Advent of Code (by aaronreidsmith)
adventofcode | advent-of-code | |
---|---|---|
55 | 25 | |
20 | 5 | |
- | - | |
7.8 | 8.0 | |
4 months ago | 4 months ago | |
Elixir | Scala | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
-
-❄️- 2023 Day 10 Solutions -❄️-
Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-
advent-of-code
Posts with mentions or reviews of advent-of-code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-12.
-
-🎄- 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?
When comparing adventofcode and advent-of-code you can also consider the following projects:
AdventOfCode2021 - Advent of code 2021
AdventOfCodeHaskell - Advent of Code in Haskell
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code
adventofcode - Answers to Advent of Code
advent-of-code-rust - 🎄Starter template for solving Advent of Code in Rust.
aoc2021 - Advent of Code 2021 - my answers
advent-of-code-2022 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2022
rockstar - The Rockstar programming language specification
adventofcode - Advent of Code challenge solutions
roast - 🦋 Raku test suite
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup
adventofcode vs AdventOfCode2021
advent-of-code vs AdventOfCodeHaskell
adventofcode vs adventofcode
advent-of-code vs advent-of-code
adventofcode vs adventofcode
advent-of-code vs advent-of-code-rust
adventofcode vs aoc2021
advent-of-code vs advent-of-code-2022
adventofcode vs rockstar
advent-of-code vs adventofcode
adventofcode vs roast
advent-of-code vs AdventOfCode-Day4-CampCleanup