AlgorithmProblems
advent-of-code
AlgorithmProblems | advent-of-code | |
---|---|---|
3 | 25 | |
11 | 5 | |
- | - | |
7.1 | 8.0 | |
4 months ago | 4 months ago | |
Python | Scala | |
- | - |
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.
AlgorithmProblems
-
-π- 2022 Day 12 Solutions -π-
github link
- -π- 2022 Day 11 Solutions -π-
-
-π- 2021 Day 9 Solutions -π-
Did a recursive DFS to solve part 2. github code
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?
competitive_programming - My solutions to programming contest problems from different sources (UVa, TopCoder, Live Archive, SPOJ, etc).
AdventOfCodeHaskell - Advent of Code in Haskell
advent-of-code - Collection of JS solutions for puzzles from adventofcode.com ππ
advent-of-code
Advent-of-Code - My solutions or attempts at solutions to the Advent of Code event.
advent-of-code-rust - πStarter template for solving Advent of Code in Rust.
advent-of-code-wim - Wim's solutions for https://adventofcode.com/ puzzles
advent-of-code-2022 - π My Advent of Code solutions in Rust. http://adventofcode.com/2022
advent-of-code - My Advent of Code submissions. For 2021 and before, these are the original code I used, without any modifications after-the-fact. As such, they are probably not as efficient or short as they should be, because I want a working solution faster, not a better solution. For 2022 and after, these are the solutions uploaded to my YouTube channel.
adventofcode - Advent of Code challenge solutions
AoC - my personal repo for the advent of code yearly challenge
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup