aoc21
adventofcode
aoc21 | adventofcode | |
---|---|---|
4 | 718 | |
2 | 65 | |
- | - | |
0.0 | 9.0 | |
over 1 year ago | 4 months ago | |
Crystal | 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.
aoc21
-
Advent of Code Day 24: Computing with Sets
The way I solved this was by squinting a little and realizing that every time a div instruction happened, then a certain number following it needed to be 0, depending on the value of certain constants embedded in the code, and also on certain other fields in the input. So instead of starting with an input number, it is possible to calculate the min and max values the fields may contain right there, as long as we embed the field positions in a stack.
As this is only going through the code once, this is virtually instantaneous and ended up as the day that was fastest of all days to compute.
https://github.com/yxhuvud/aoc21/blob/main/day24.cr
-
[2021] Solving AoC with Rust before Python can start
My solution, https://github.com/yxhuvud/aoc21/blob/main/all_days.cr :
-
Speeding up Dijkstra by a factor of 2700
Yes, though sometimes it is possible to replace a fully general priority queue with a faster structure that is using the structure of the problem at hand. For example, this problem (AoC day 15) has only ever a count of unique priorities that is 10 or fewer. That allows a queue implementation to be https://github.com/yxhuvud/aoc21/blob/main/day15.cr#L27-L51 , being amortized O(1) in both insertion and deletion. This pushed down the runtime another magnitude for me, the whole day running at 0.014s.
- -🎄- 2021 Day 18 Solutions -🎄-
adventofcode
-
-❄️- 2023 Day 6 Solutions -❄️-
On GitHub.
-
-🎄- 2022 Day 21 Solutions -🎄-
My Scala solution – to be cleaned up.
-
Advent of Code (in MiniScript), Day 18
Welcome back to my series of Advent of Code solutions in MiniScript! Day 18 was pretty straightforward, though it presents some interesting choices in how to represent the data -- choices I'm not sure I made optimally.
-
-🎄- 2022 Day 18 Solutions -🎄-
My Scala solution.
-
Late bloomers (that started life closer to 30), how are things going for you?
And I've solved all of the Advent of Code problems so far this year, which is utterly unimportant but still brings me joy.
-
Coding/programming is absolutely fantastic
If you'd enjoy some coding challenges, advent of code (https://adventofcode.com/) is currently going on.
-
Advent of Code (in MiniScript), Day 17
Welcome back to my series of Advent of Code solutions in MiniScript! In Day 17 we got to (sort of) play Tetris. Five different Tetris-like shapes fall into a pit, moved left or right on each step according to the input. The first task is to see how high this stack will grow after 2022 blocks have been dropped in.
- Can someone give me a good idea for C# console app I could make?
- The Empty List
-
Advent of Code (in MiniScript), Day 16
Welcome back to my series of Advent of Code solutions in MiniScript! Day 16 was... how to put this?
What are some alternatives?
nom - Rust parser combinator framework
codewars.com - Issue tracker for Codewars
Advent-of-Code - Advent of Code
bitburner - Bitburner Game
aoc
LeetCode - This is my LeetCode solutions for all 2000+ problems, mainly written in C++ or Python.
Exercism - Scala Exercises - Crowd-sourced code mentorship. Practice having thoughtful conversations about code.
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
mal - mal - Make a Lisp
adventofcode - Solutions for problems from AdventOfCode.com
book - The Rust Programming Language