Advent-of-Code VS adventofcode

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

Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.

[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex