advent_of_code VS advent-of-code-kotlin

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.

Kotlin solution (part 1 and part 2 merged)

Kotlin solution, probably not the most efficient but does the job.

Kotlin solution for day 7, can be done fairly concisely:

Kotlin solution using a fish counter map:

Day 3 — a few key concepts used are: extensions for example on List type higher-order functions aka a function which takes other functions as parameters

Nice! here is my solution also in Kotlin

Kotlin solution for day 3, not the most concise nor most optimized but gets the job done and fairly readable.

Kotlin, solution for part 1 and 2 — not super concise but a few cool concepts if you're learning the language.

You can find the source code for my solution here.