adventofcode
Solutions for problems from AdventOfCode.com (by bhosale-ajay)
advent-of-code
My solutions to the Advent of Code (by aaronreidsmith)
Our great sponsors
adventofcode | advent-of-code | |
---|---|---|
86 | 25 | |
16 | 5 | |
- | - | |
7.3 | 8.0 | |
4 months ago | 4 months ago | |
TypeScript | 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 -❄️-
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
-
-❄️- 2023 Day 7 Solutions -❄️-
The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.
-
-❄️- 2023 Day 6 Solutions -❄️-
Easy day TypeScript, P1 - Brute Force, P2 - Formula
- -❄️- 2023 Day 5 Solutions -❄️-
-
-❄️- 2023 Day 4 Solutions -❄️-
[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.
-
-❄️- 2023 Day 1 Solutions -❄️-
[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)
-
-🎄- 2022 Day 25 Solutions -🎄-
F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD
-
-🎄- 2022 Day 24 Solutions -🎄-
F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.
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:
AoC - my personal repo for the advent of code yearly challenge
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-rust - 🎄Starter template for solving Advent of Code in Rust.
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-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
advent-of-code
advent-of-code
advent-of-code-2022 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2022
adventofcode vs AoC
advent-of-code vs AdventOfCodeHaskell
adventofcode vs adventofcode
advent-of-code vs advent-of-code-rust
adventofcode vs adventofcode
advent-of-code vs adventofcode
adventofcode vs Advent-of-Code
advent-of-code vs AdventOfCode-Day4-CampCleanup
adventofcode vs advent-of-code-go
advent-of-code vs advent-of-code
adventofcode vs advent-of-code
advent-of-code vs advent-of-code-2022