aoc
My solutions to the https://adventofcode.com/ (by vollcheck)
advent-of-code
My solutions to the Advent of Code (by aaronreidsmith)
aoc | advent-of-code | |
---|---|---|
10 | 25 | |
2 | 5 | |
- | - | |
6.4 | 8.0 | |
about 1 month ago | 4 months ago | |
Clojure | 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.
aoc
Posts with mentions or reviews of aoc.
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 -π-
Aimed for self-explanatory code after making buzz yesterday
-
-π- 2022 Day 2 Solutions -π-
nothing special but it just works
-
-π- 2022 Day 1 Solutions -π-
Solution on GitHub
-
-π- 2021 Day 10 Solutions -π-
My solution in Clojure. That was pretty easy for me, even though I'm still beginner!
-
-π- 2021 Day 8 Solutions -π-
My solution in Clojure. It was pretty loooooong and still leaves couple points of possible improvement.
-
-π- 2021 Day 7 Solutions -π-
My solution in Clojure, however should optimize part two as it takes 7s and is pretty naive approach.
-
-π- 2021 Day 6 Solutions -π-
My solution in Clojure, although need to perform some time on optimization as the current version is really slow... Feel free to suggest possible improvements
-
-π- 2021 Day 3 Solutions -π-
Publishing only first part in *Clojure* as I'm still working on the 2nd part. Hard exercise, but full of things to learn.
-
-π- 2021 Day 2 Solutions -π-
Here's my solution in Clojure. Still feeling like a beginner though, need to refactor solution using reduce.
-
-π- 2021 Day 1 Solutions -π-
Here's my solution in Clojure. Feel free to correct me as I'm still beginner.
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 aoc and advent-of-code you can also consider the following projects:
adventofcode - My solutions to the Advent of Code challenges
AdventOfCodeHaskell - Advent of Code in Haskell
aoc2021 - My solutions to Advent of Code 2021.
advent-of-code
advent_of_code - Solutions to programming puzzles on Advent of Code
advent-of-code-rust - πStarter template for solving Advent of Code in Rust.
adventofcode - Advent of Code challenge solutions
advent-of-code-2022 - π My Advent of Code solutions in Rust. http://adventofcode.com/2022
aoc2021 - Advent of Code 2021 Solutions
AdventOfCode2021.jl - Advent of Code 2021 in Julia
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup
aoc vs adventofcode
advent-of-code vs AdventOfCodeHaskell
aoc vs aoc2021
advent-of-code vs advent-of-code
aoc vs advent_of_code
advent-of-code vs advent-of-code-rust
aoc vs adventofcode
advent-of-code vs advent-of-code-2022
aoc vs aoc2021
advent-of-code vs adventofcode
aoc vs AdventOfCode2021.jl
advent-of-code vs AdventOfCode-Day4-CampCleanup