AlgorithmProblems
advent-of-code
AlgorithmProblems | advent-of-code | |
---|---|---|
3 | 13 | |
11 | 13 | |
- | - | |
7.1 | 0.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
-
[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?
competitive_programming - My solutions to programming contest problems from different sources (UVa, TopCoder, Live Archive, SPOJ, etc).
advent-of-code-data - Download Advent of Code input data with ease.
advent-of-code - Collection of JS solutions for puzzles from adventofcode.com 🎁🎄
advent-of-code-scala - Solving advent of code challenges
Advent-of-Code - My solutions or attempts at solutions to the Advent of Code event.
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
advent-of-code-wim - Wim's solutions for https://adventofcode.com/ puzzles
advent-of-code
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.
advent-of-code-2020
AoC - my personal repo for the advent of code yearly challenge
adventofcode2022