Advent-of-Code
bad christmas spaghett (by YelovSK)
advent-of-code
My solutions to the Advent of Code (by aaronreidsmith)
Advent-of-Code | advent-of-code | |
---|---|---|
7 | 25 | |
0 | 5 | |
- | - | |
6.8 | 8.0 | |
5 months ago | 4 months ago | |
Python | 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.
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-07.
-
-π- 2022 Day 8 Solutions -π-
Part 1 - used all() for checking.
-
-π- 2021 Day 16 Solutions -π-
GitHub link - I didn't know how to call my parse_packet function if I got a specific length vs a number of packets in the operator, so if I get a specific length I call the function recursively and if I get a number of packets I call it N times without recursion.
-
-π- 2021 Day 14 Solutions -π-
GitHub link - keeping track of pair counts and character occurences.
-
[2021 Day 13 (Part 2)][Haskell] Output is a bit wrangled
Does your output look like this? I also did it by actually having a 2D list. At least in my case the problem was not checking if the fold is even. If one half is larger by 1 than the other half it will create this issue. This.
-
-π- 2021 Day 11 Solutions -π-
GitHub link - recursive flash with a global variable
-
-π- 2021 Day 10 Solutions -π-
GitHub link
-
-π- 2021 Day 8 Solutions -π-
This is my first solution for part 2, it runs instantly but it's ugly af - GitHub solution.
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 Advent-of-Code and advent-of-code you can also consider the following projects:
advent-of-code
AdventOfCodeHaskell - Advent of Code in Haskell
aoc2021 - Advent of Code 2021 Solutions
advent-of-code
AdventOfCode2021.jl - Advent of Code 2021 in Julia
advent-of-code-rust - πStarter template for solving Advent of Code in Rust.
AdventOfCode2021
advent-of-code-2022 - π My Advent of Code solutions in Rust. http://adventofcode.com/2022
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
adventofcode - Advent of Code challenge solutions
Advent-of-Code - Advent of Code
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup
Advent-of-Code vs advent-of-code
advent-of-code vs AdventOfCodeHaskell
Advent-of-Code vs aoc2021
advent-of-code vs advent-of-code
Advent-of-Code vs AdventOfCode2021.jl
advent-of-code vs advent-of-code-rust
Advent-of-Code vs AdventOfCode2021
advent-of-code vs advent-of-code-2022
Advent-of-Code vs aoc2021
advent-of-code vs adventofcode
Advent-of-Code vs Advent-of-Code
advent-of-code vs AdventOfCode-Day4-CampCleanup