advent-of-code-2022 VS adventofcode

My current solution (in Common Lisp) solves both of those (hopefully correctly!)

https://github.com/alecigne/advent-of-code https://github.com/astynax/adventofcode2022.lisp https://github.com/aximili-dev/aoc-2022 https://github.com/blake-watkins/advent-of-code-2022 https://github.com/dawranliou/advent-of-code/ https://github.com/dmgk/aoc-2022 https://github.com/jackie-jackie/AoC https://github.com/leolaporte/aoc-cl https://github.com/leozamboni/aoc-2022 https://github.com/michaeldelago/aoc-2022 https://github.com/omarbassam88/aoc2022-cl https://github.com/poesraven8628/AdventofCode2022 https://github.com/Quiescent/advent-of-code-2022-in-common-lisp https://github.com/ryukinix/adventofcode/ https://github.com/staudtlex/advent-of-code-2022 https://github.com/taDachs/aoc-2022-lisp/tree/main/6 https://github.com/wsgac/advent-of-code-2022 https://github.com/xvan/adventofcode-2022 https://github.com/xxmyc/advent-of-code-2022-common-lisp https://github.com/ZachFontenot/adventofcode

I'm posting my solutions on the advent of code solution megathread each day, but here's the github link to them too https://github.com/blake-watkins/advent-of-code-2022

Common Lisp 3139 / 2967

Common Lisp 2468/2489

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