Day 12 of #AdventOfCode was fun because I got to revisit the union-find algorithm that I learned in grad school. (I found a #RustLang crate that implemented it for me, which was great.) Counting the edges of the shapes was challenging. My solution runs in 0.734 millis. github.com/omalley/adve...