AdventOfCode VS adventofcode

Python 3 Ah.. good old recursion in this one :) More a "flow up" than a "flow down". Still learning Python and open to suggestions. Solution A & B

Python 3 Decode the mapping of each segment in a 7-seg display, then decode the input with that built up dictionary. Could probably improve that mapping in some way, as it's really ugly. However once i've gotten that logic down Part A and B become very easy. Solution A & B

Python 3 O(n) runtime for both solutions, using median and mean to calculate the best possible meeting place. Part B uses the Gaussian Sum to calculate the cost. Solution A & B

Python 3.10 Solution A & B Open to any suggestions, still learning Python. Could probably change the two for loops in the actual solution into a list comprehension to generate a list of completions and their scores...

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