advent-of-code-rust VS Advent-of-Code

https://github.com/fspoettel/advent-of-code-rust best rust aoc template imo

It's Christmas time and time for Advent of Code 2023 edition. Starting from today I will try to solve puzzles in Rust and publish a post a day in which I tell my solution. My goal is not to climb the leaderboard but to use the problems to practice writing Rust code and improve my language knowledge. Copilot yes or Copilot not? It's for learning so Copilot definitely not. The solutions will be available at the following git repository, as I don't have much time to write a template from scratch, I will use the starter template available here.

If you haven't tried Rust:

Someone put together a very nice template in Rust that automatically downloads tests, solutions, creates a scaffold for the binaries, etc and submits solutions through CLI. I used this template last year to learn Rust and it got me "up and running" quickly and easily.

https://github.com/fspoettel/advent-of-code-rust

18. 👨👴 Advent of Code is a yearly event where you can solve small (but high-quality) programming puzzles in any language you want. It can be applied to any language that you are learning. You might find this, this, and this repo useful as well where they provide templates and solutions for prior years.

I know you mentioned you were using this an exercise to learn macros so feel free to ignore this, but I like using this template repository for Advent of Code. It treats each day as a separate binary, but main.rs will run through all the days.

I'm using this template. If you are familiar with Rust you could try running my code in this template to see what speeds you get. This is with the --release flag.

Great solve! Mine ended up being much more complicated since I tired to predict the part 2... Can recommend using a template so you dont have to repeat the whole cargo things, I use this one that builds templates, test and downloads input etc https://github.com/fspoettel/advent-of-code-rust

Swift. I tried to use GameplayKit's pathfinding, but I got fed up with it being in Objective-C and not working with subtypes properly. shortestPathSources is just an implementation of Dijkstra that works on matrices.

Swift.

Swift. Algorithms had me covered for Part 2, but I had to make something for Part 1 that would allow for getting the elements of a Sequence based on sorted offsets, without having to start from the beginning each time.

I recommend SIMD2—it can save you a lot of reinventing the 2D wheel!

Swift. We don't have good types for this. 🤮

Swift. containsOnlyUniqueElements is not in the standard library; it relies on this Set initializer.

Works grood.

No, I edited my comment. I was wrong in thinking that there was a proper overload. The one I'm using is just from `extension Collection where Self.Element : Equatable` in the new _StringProcessing section for Regex. It gives the correct result, but it's not as fast as it could be. (https://stackoverflow.com/questions/64066681/check-if-one-range-is-within-another)

Swift, using some helpers for `CaseIterable`.