https://github.com/alper/aoc2019/blob/master/src/aoc/day6.clj#L131

https://github.com/alper/aoc2019/blob/master/src/aoc/day8.clj#L22

Nice 🙂 Happy to see I’m not the only one still doing puzzles. I liked this tip someone gave me earlier:

(let [ys (descendants ::YOU)
      ss (descendants ::SAN)]
  (count
   (set/difference
    (set/union ys ss)
    (set/intersection ys ss))))

I think your part 2 can also be shortened using set operations only

Yeah, I’m plugging away to get comfortable with the language. That’s going pretty well by now.

I’m skipping the intcode ones because I originally started this in Haskell and I’m not sure whether I want to port my intcode computer to Clojure.