AOC2023 VS AoC

Can check it here: https://github.com/vorber/AOC2023/blob/main/src/day8/Program.fs

[LANGUAGE:F#]https://github.com/vorber/AOC2023/blob/main/src/day7/Program.fsAfter the difficulty roller-coaster of the previous days I expected this one to be a bit more challenging :)

Did day 3 in F# without using 2d arrays (or explicit loops, or recursive calls). All the information you need is very local - you only need to look back and forward at most 1 line, so as soon as you can transform your sequence of lines into sequence of 3-line windows - you don't need 2d anymore. Can check it out here: https://github.com/vorber/AOC2023/blob/main/src/day3/Program.fs Keep in mind that this is only my 3rd day of using F#

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