advent-of-code VS advent-of-code

Very compact solution using the quadratic formula and a little approximation hackery: https://github.com/chenson2018/advent-of-code/blob/main/2023/06/ocaml/06.ml

Rust: https://github.com/chenson2018/advent-of-code/blob/8c5df61380200d5274199ad1a7751c3a87d01f65/2022/15/rust/src/main.rs

I didn't feel like dealing with it at all, so I just pasted in the input and used them to replace things to match the type I defined: https://github.com/chenson2018/advent-of-code/blob/main/2022/13/ocaml/13.ml

APL: https://github.com/chenson2018/advent-of-code/blob/main/2022/03/apl/03.apl

Solutions in both OCaml and awk: https://github.com/chenson2018/advent-of-code/tree/main/2021/01

[LANGUAGE: Python 3] 153/75 Raw solution

One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).

That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)

[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code

[LANGUAGE: Python 3] 66/101 Raw solution code

Python 3 21/12

It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.

Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.

Python 3 9/15!!!

Python 3 44/45