advent_of_code VS AOC2023

Anyway my solution available on my GitHub

This was a tricky one, but I managed to solve it in an effective way (the lcm method). As always you can see it on my GitHub.

I really loved this one, I enjoyed doing it and I'm happy with how I managed to deal with it. You can see my solution to both parts on my GitHub.

My Day 6 solution on GitHub

Anyway, here it is.

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#