advent-of-code VS advent_of_code

Python day 20, code for part 1 also worked for part 2 without any changes.

Python day 17

Python day 16. In part 1 I apparently do the parsing from hex to binary wrong, however, it works. This gave me problems in part 2 so I reworked that (and the rest of the code).

Python day 15 where I did part 1 with a cumulative sum. Doesn't work if the path has to go up/left.

For day 11 I used convolution btw. Check it out here if you're interested!

Python day 14 where part 2 is a bit messy but it seems to be very efficient.

I have no idea how I would benchmark everything without going into each file and benchmarking them individually. This is my repo. I have a folder in the root folder (where the link takes you) and I wanted to add a `benchmark.py` into the `2021` folder. But when I execute the files, I get a `FileNotFoundError` error.

Python day 11 using convolution

Python day 2

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.