AdventOfCode VS advent_of_code

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...

Here's the relevant extract from my (recursive) solution. Full code on GitHub.

Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.

Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.

Full code on github.

The core of my solution below using numpy (because I'm learning it!). See github for full code.

Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].

Below is the new solution, which works for part 1 and 2. The full code is on GitHub.

These are the key functions. The whole code is on GitHub

Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub

Code is on GitHub.