advent_of_code VS AdventOfCode2021

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.

I found this repository which solves the problem by having a src/main.rs file which basically calls cargo run --release {day} and parses the output to extract the time each day took, but I don't find this very satisfactory. I'd prefer to have everything compiled into the same executable, without having to run external commands.

You can always check out the problems from previous years.

https://adventofcode.com/2021 for practice.

Here is 2021: https://adventofcode.com/2021