aoc-2022 VS Advent-of-Code

Djikstra with Binary Heap in Rust. Not super clean, but it works...

My Rust solutions. Any ideas on how to make iterating vector elements while mutating other elements of the same vector more elegant?

My todays Rust solution. :)

My Rust solution, pretty happy with the update function...

My Rust solution with tuple pattern matching. Tried to write it as idiomatic as I could, any advice?

Not sure about this solution in RUST for today with linked lists...

My Rust solution for day 4.

RUST Started learning Rust, comments are welcome! :)

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`.