ham-fisted VS AdventOfCode2022

3 - Similar to 2, the savings of mutably building the collection have to outweigh the cost of persisting it. Or if you are using the transient as a mutable container (e.g. held by an item) for limited random access and writes (as opposed to say a mutable arraylist or hashmap or hashset), performance should still be substantially better for writes over the persistent counterparts. The most gains come from building up large collections, using transients to mutably collect values and then persist at the end. Similar idea (but more general) in ham-fisted.

I have taken the time in between caring for my young son to write a new library that provides higher performance datastructures and algorithms for Clojure.

Here are all my solutions.

The same approach as my Python solution — for each row, it tracks the left-most and right-most seen point for each sensor. Then it searches if there has been a gap between two sensors.

In the end, my solution, especially in the game logic part, is heavily based on the stuff you did.

Here is my repo.

Repo: Python and Clojure solutions

But to be honest, I like my Clojure solution even more.