AdventOfCode_Main
By blfuentes
advent-of-code
Advent of Code (by MichaelBrunn3r)
AdventOfCode_Main | advent-of-code | |
---|---|---|
3 | 7 | |
0 | 1 | |
- | - | |
9.1 | 9.5 | |
about 2 months ago | 5 months ago | |
F# | Rust | |
- | - |
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_Main
Posts with mentions or reviews of AdventOfCode_Main.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-08.
-
-❄️- 2023 Day 9 Solutions -❄️-
Nice an easy one to start the weekend happy...but I think we'll be crying tomorrow as visit the island... Link Github 2023 Day 09
-
-❄️- 2023 Day 7 Solutions -❄️-
Link Github 2023 Day 07
-
-❄️- 2023 Day 6 Solutions -❄️-
I left the brute force in the helpers fsx and used the math in the main fs Link Github 2023 Day 06
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-07.
-
-❄️- 2023 Day 8 Solutions -❄️-
[LANGUAGE: Rust]I was running in circles trying to solve this one.First part was easy enough. I was running into an infinite loop in part 2 and then sadly was spoilered the LCM solution. At least I head fun optimizing the code :)Part 2: I converted the 3 char node names into u16 keys. I store the keys of the left/right successors of each node in a massive array, which I can simply index with they node keys. This proved significantly faster than a HashMap. While converting lines into nodes, I store all keys of nodes ending in an A in a starting nodes array. Next, I calcualte the cycle length for each starting row and then calculating the common LCM. I used rayon to speed things up with multithreading (minor improvement)[Code]
-
-❄️- 2023 Day 7 Solutions -❄️-
38.659 µs / 41.981 µs after removing some allocations and custom input parsing [Code].
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
- -❄️- 2023 Day 4 Solutions -❄️-