advent-of-code VS AoC

I implemented it with A*. For part two, I just ran A* concurrently on every coord with starting point A, which is actually very easy in Rust! (I mostly did this to learn about concurrency in Rust. It's about 4 times faster than just running A* one by one.)

A less clever Rust solution which maintains a vector of "last few chars". At each iteration, that vector is cast to a set to check for uniqueness. Technically still O(N):

Rust solution which implements contains/overlaps extensions for the `Range` type: https://github.com/noahtallen/advent-of-code/blob/trunk/src/y2022/day4.rs

Very non-clever implementation with a lot of enums... maybe one layer too many of enums :)

20ms both parts https://github.com/Fadi88/AoC/blob/master/2023/day11/code.py

Same Algo as my python code from earlier, now just using math not search space reduction also blazing fast in micro seconds https://github.com/Fadi88/AoC/tree/master/2023/day06