aoc
🎄 My solutions and walkthroughs for Advent of Code and more related stuff. (by mebeim)
advent-of-code
For sharing my adventofcode.com solutions (by kbielefe)
Our great sponsors
aoc | advent-of-code | |
---|---|---|
24 | 13 | |
380 | 13 | |
- | - | |
8.9 | 0.0 | |
4 months ago | 4 months ago | |
Python | Scala | |
GNU General Public License v3.0 or later | - |
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 2023-12-09.
-
-❄️- 2023 Day 10 Solutions -❄️-
1076/1738 — Raw solution (to refactor/possibly rewrite)
-
-❄️- 2023 Day 9 Solutions -❄️-
Solution
- Advent of Code day 08
-
-❄️- 2023 Day 8 Solutions -❄️-
Busy day today, going back to sleep zzZZZ. Clean solution and walkthrough here later today (hopefully).
- Advent of Code day 07
-
I am stuck!
If you're using Python, you can check this guy walkthroughs, he's good at explaining things and uses many Python's features to write clean code. I'd suggest to try tackle a problem on your own, and whether you manage to get a solution or not, read his walkthrough, and re-implement a solution using his ideas. This is what I did two years ago and it was a big help for me, I was more and more able to come up with solutions without looking at what he did. I still check what he does today, but I always solve the problem on my own first now.
-
Advent of code day 04
758/2614 — Soluzione Python 3 — Walkthrough (inglese)
-
Need help finding good python solutions
Solutions and walkthroughs for most of the years.
-
AdventOfCode 2022, giorno 25
Congrats /u/skifire13 per il rank #233 globale, nice!
- AdventOfCode 2022, giorno 15
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 2023-12-05.
-
[2023 Day 5 Part 2] Haskell libraries really shine here
I didn't realize Haskell had that. I wrote a similar Scala library for 2022 Day 15 that's basically the encapsulated equivalent of a [Range a], but I really like the API of Haskell's library. Especially Haskell always handles infinite sequences well.
-
-❄️- 2023 Day 5 Solutions -❄️-
[LANGUAGE: Scala] GitHub
-
[2022 All Days]
Here's mine. Most of it I wrote in prior years, but refined this year. To account for problem-specific details, the functions are very generic and higher-order. It has a handful of well-known algorithms like A* and Floyd-Warshall, some handy data structures like circular buffers and intervals, and some type classes that are useful for parsing puzzle input.
-
-🎄- 2022 Day 18 Solutions -🎄-
Scala 30ms + 70ms
-
-🎄- 2022 Day 15 Solutions -🎄-
Scala 6.5 seconds.
-
-🎄- 2022 Day 13 Solutions -🎄-
Scala
-
-🎄- 2022 Day 12 Solutions -🎄-
I wrote an immutable A* in Scala a few years ago. It's not too bad if you have immutable hash maps and an immutable priority queue. Comes in handy for a lot of puzzles.
-
[2022 day 4] My experience in a nutshell
Last year I made myself an input parsing library that was really nice for this problem. I just create a Pair class with 4 number members, then ask for a List[Pair] and it knows what to do. My solution.
-
Best immutable priority queue for scala
I implemented my own using a pairing heap. It sped up my immutable A* considerably, but I was just using minBy on a List before that. Inserts are amortized O(1) and delete-mins are O(log n).
-
What is the best way to read a text file of your input in your language of choice?
This year I'm creating a Scala library to make it easier. I specify a type like List[Int] and it summons the correct type classes to parse it into that format for me.
What are some alternatives?
When comparing aoc and advent-of-code you can also consider the following projects:
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
advent-of-code-data - Download Advent of Code input data with ease.
Advent-of-Code - C# solutions for Advent of Code puzzles
advent-of-code-scala - Solving advent of code challenges
hashbrown - Rust port of Google's SwissTable hash map
advent-of-code
AdventOfCode-rs - The https://adventofcode.com in idiomatic declarative Rust
advent-of-code-2020
advent_of_code
AdventOfCode2022 - In C11 with a pinch of GLib
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
adventofcode2022
aoc vs advent-of-code-2020
advent-of-code vs advent-of-code-data
aoc vs Advent-of-Code
advent-of-code vs advent-of-code-scala
aoc vs hashbrown
advent-of-code vs advent-of-code
aoc vs AdventOfCode-rs
advent-of-code vs advent-of-code-2020
aoc vs advent_of_code
advent-of-code vs AdventOfCode2022
aoc vs Advent_of_Code_in_Pascal
advent-of-code vs adventofcode2022