adventofcode-2022-rs
By SkiFire13
AdventOfCode
Advent of code daily challenge (by WilliamLP)
adventofcode-2022-rs | AdventOfCode | |
---|---|---|
7 | 15 | |
3 | 2 | |
- | - | |
3.2 | 0.0 | |
6 months ago | over 1 year ago | |
Rust | Python | |
- | - |
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-2022-rs
Posts with mentions or reviews of adventofcode-2022-rs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-01-01.
- How to organize the project structure for Advent of Code?
-
Meeting the "15 seconds on 10 year old hardware" in the aoc about section (2022)
My solutions (github) run in a bit more than 50ms on my pc. The slowest days are 20 and 23, with 23 taking up ~30ms, 20 taking up ~10ms and all the other combined taking up ~10ms.
-
[2022 day 16 (part 2)] [python 3.10] Can my solution be optimized?
I implemented the last upper bound in my solution and it results in 1ms total time (in Rust, but it explores only ~100 nodes in part 1 and ~1000 nodes in part 2 so I expect very small timings with other languages as well) https://github.com/SkiFire13/adventofcode-2022-rs/blob/master/src/day16.rs
-
-🎄- 2022 Day 19 Solutions -🎄-
32/14 Rust, just bruteforced the heck out of it, took 6-7 minutes but was worth the wait. Later I will clean it up. https://github.com/SkiFire13/adventofcode-2022-rs/blob/master/src/day19.rs
- AdventOfCode 2022, giorno 14
- AdventOfCode 2022, giorno 06
-
AdventOfCode 2022, giorno 02
Soluzione: https://github.com/SkiFire13/adventofcode-2022-rs/blob/master/src/day2.rs
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 2022-12-23.
-
-🎄- 2022 Day 24 Solutions -🎄-
Just a basic BFS. My part 2 ran in 1.77 seconds.
-
-🎄- 2022 Day 19 Solutions -🎄-
Here's my solution. It's a bit of a janky script.
-
-🎄- 2022 Day 17 Solutions -🎄-
Yet another Python solution to part 2. My Python code isn't the best but I haven't seen many solutions that detect cycles programmatically.
-
-🎄- 2022 Day 16 Solutions -🎄-
There's nothing particularly nice about my Python solution but in case anyone's interested here it is. I find all points' shortest paths using floodfill and a loop because I couldn't recall Floyd-Warshall. And then it's a DFS, branching every turn when the human or elephant can make a choice to move to another valve and open it. Debugging was tricky.
-
-🎄- 2022 Day 5 Solutions -🎄-
You can check my solutions from last year https://github.com/WilliamLP/AdventOfCode/tree/master/2021 I made it up to day 14 / 17 and used that WITH RECURSIVE / UNNEST / ARRAY_AGG pattern a lot.
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
- -🎄- 2021 Day 22 Solutions -🎄-
-
-🎄- 2021 Day 19 Solutions -🎄-
I got there, but math! It took a few hours, more along the lines of a weekend project than a quick puzzle! The hardest part is working with the 24 orientations I think. I needed to dust off a little bit of linear algebra and used matrices. There are 6 permutations of the 3 coordinates, and 8 flips (+- on each axis). Composing those gives 48 transformations but half of them are the wrong chirality (mirror image) so we want only the half with determinant equal one. After that it's just a bunch of picky loops and debugging. https://github.com/WilliamLP/AdventOfCode/blob/master/2021/day19.py
- -🎄- 2021 Day 14 Solutions -🎄-