adventofcode
By julianandrews
advent-of-code
For sharing my adventofcode.com solutions (by kbielefe)
adventofcode | advent-of-code | |
---|---|---|
11 | 13 | |
8 | 13 | |
- | - | |
8.9 | 0.0 | |
3 months ago | 4 months ago | |
Rust | 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-02-09.
-
[2021 Day 6 (Part 2)] [Rust] Pretty darn elegant
This lets you cut out the relatively expensive fcount.remove(0) operation, and each loop is basically one addition and a few assignments. Full solution here.
-
-🎄- 2022 Day 13 Solutions -🎄-
Code
- -🎄- 2022 Day 12 Solutions -🎄-
-
Advent of Code: Day 3
Your solution is pretty much exactly the super concise version of my definitely over-engineered solution.
-
[2022 Day 2] Data structures good control flow bad!!!
You can see the code here
-
AOC Day 2
Here's my solution
-
[2015 day 04][Zig] Some tips to solve the problem without brute force?
Your solution looks remarkably similar to my Rust solution which solves both parts in 1.6s on the cheap NUC I use as my coding workstation.
-
2020 Day 8.2 in Python - trying to figure out how to do this efficiently?
It's in Rust, so I'm not sure how readable you'll find it, but in case it helps, you can see the code here.
-
Programing midlife "crysis"
I found a single crate with a bunch of binaries worked well. It let me use a shared library easily. You can see my crate organization here if that's helpful.
-
2020 day 7 (part 2) How would you solve this without recursion?
You can see my code here in case it helps.
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 adventofcode and advent-of-code you can also consider the following projects:
adventofcode.sh - Advent of Code 2020 and 2015, done in bash. Because why not?
advent-of-code-data - Download Advent of Code input data with ease.
advent - Advent of Code - Ada
advent-of-code-scala - Solving advent of code challenges
advent-of-code-golf-2020 - doing the same thing over and over and expecting the same results
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
advent - Solving Advent of Code problems. See https://adventofcode.com/
advent-of-code
AdventOfCode2022
advent-of-code-2020
advent-of-code-2020 - Solutions of Advent of Code 2020
adventofcode2022
adventofcode vs adventofcode.sh
advent-of-code vs advent-of-code-data
adventofcode vs advent
advent-of-code vs advent-of-code-scala
adventofcode vs advent-of-code-golf-2020
advent-of-code vs aoc
adventofcode vs advent
advent-of-code vs advent-of-code
adventofcode vs AdventOfCode2022
advent-of-code vs advent-of-code-2020
adventofcode vs advent-of-code-2020
advent-of-code vs adventofcode2022