advent-of-clojure VS advent_of_code

Clojure: https://github.com/motform/advent-of-clojure/blob/master/src/advent_of_clojure/2022/06.clj

Clojure, quite happy with this one, simply using a stack and the assumptions we know about the input to easily compare, filter and then match.

Clojure, for sure my worst one yet. BUT, I did get to use `clojure.set/invert-map` twice, so I count that as a partial win.

Clojure, using (almost) exclusively set logic. Looking at the other solutions, it could have probably been simplified, but I'm somehow compelled to use sets whenever I get the chance.

Very similar to mine, clearly the platonic Clojure solution to the problem.

Clojure, mainly list manipulation and `core`.

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.