AdventOfCode2022 VS adventofcode

Day 11 Solutions - I'm a bit tired but will come back to this tomorrow to try to optimize it a little more and to look at other answers to see if I missed anything. I had originally tried with BigInteger (and no modulo lol) and that seemed like it was gonna run for like a week or something for Part 2, so glad I could get it to a couple seconds but wondering if there is more to do

Day 8 Solution

Kotlin for Day 3 https://github.com/jdvp/AdventOfCode2022/blob/main/src/main/kotlin/me/jdvp/adventofcode/daily/Day3.kt

So I was code-golfing my solution a lot and trying various stuff to remove when statements in my Kotlin code and have the solution be purely mathematical, my full solution here: Day 2 Solution

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