aoc-2021-clj VS adventofcode

I'm very late to the party, so I'll just reply to your comment with my solution source and tests. Like you, my initial solution was very slow for part 1 (slower than yours, I think). After refinement, part 2 finishes in about 30 seconds whereas yours takes roughly 60 seconds on my machine. I haven't examined your solution much, but I'm guessing the difference is (unsurprisingly) the queue of remaining nodes.

Clojure, source and tests. Brute forced part 1 but refined the solution for part 2 which runs in about 30ms (not bad, I'd say!).

Catching up once again. Here's the Clojure source (no tests this time... but here's the parsing source. Here's how I ran it at the REPL:

Clojure, source and tests. Part 1 was simple but I couldn't get anything going for part 2 after a couple of hours. I initially tried a naive DFS approach (which I know essentially nothing about) but wasn't successful in constructing a tree from a low point.

Finally caught up! Here's the Clojure source and tests for today.

Catching up from a set back on day 5 (I almost had a working sweep algorithm but gave up) and the weekend in general. Here's the Clojure source and tests. As usual, feedback welcome!

Clojure, source and tests. Any feedback welcome!

The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.

Easy day TypeScript, P1 - Brute Force, P2 - Formula

[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.

[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)

F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD

F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.