Copyright | (c) Eric Mertens 2018 |
---|---|
License | ISC |
Maintainer | emertens@gmail.com |
Safe Haskell | None |
Language | Haskell2010 |
https://adventofcode.com/2018/day/2
Day 2 has us count up the occurrences of characters in words and find pairs of characters that match except for a single position.