advent_of_code VS adventofcode

In case you'd like to see an implementation, take a look here, though I'd suggest attempting to code it in without looking.

Part 2 (Each file is a self-contained solution)

In case you're pursuing this and want a reference: Part 1 Part 2 implemented using unique_ptr in cpp.

One more for the list: https://github.com/vss2sn/advent_of_code

Part 1

Solutions in C++: Part 1 Part 2 (As always, every file is a self ontained solution) Explanatory notes added for the math used.

Should you choose the latter: Part 2 in C++.

Solutions in C++: Part 1 Part 2

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