Question about Day 7 Part 2 (in thread to avoid spoilers)
Is this not basically binomial coefficents / pascals triangle ? Or am I going down the wrong path entirely ?
Huh, I guess it would be if there were a splitter immediately below every beam. So you can’t use the exact same numbers, but a similar approach to solving it will work.
Day 8 - Solutions
That’s what I do, but… still missing some subtlety somewhere so that I don’t get the correct result yet (though I do for the example).
https://github.com/FelipeCortez/advent-of-code/blob/master/2025/08.clj
Day 8 notebook: https://narimiran.github.io/aoc2025/src/day08/
https://github.com/genmeblog/advent-of-code/blob/master/src/advent_of_code_2025/day08.clj
Haven't posted any of my solutions this year but I had fun with this one. https://gitlab.com/zamansky/advent2025/-/blob/main/src/day08.clj?ref_type=heads
https://gitlab.com/maximoburrito/advent2025/-/blob/main/src/day08/main.clj
https://github.com/rjray/advent-2025-clojure/blob/master/src/advent_of_code/day08.clj I really thought part 2 was scary when I first read it, but it turned out to take less than 1/4 the time part 1 had, and ran faster than part 1 did.
extreme brute force engaged https://github.com/minikomi/advent-of-code/tree/4d64ac8343df09410939631effa673c251ec7366/2025/src/day8.clj Getting all the distances, sorting and then building the network
catching up with no refactoring (UPD slightly refactored)
Had trouble with this one.
https://github.com/samcf/advent-of-code/blob/main/2025-08-playground.clj
Uses combinations from combinatorics and an adjacency list expressed with a map of points to sets of connected points. merge-with to update the adjacency list.
https://github.com/benfle/advent-of-code/blob/main/src/advent_of_code/2025/08.clj