sln_2018_02
Copyright(c) Eric Mertens 2018
LicenseISC
Maintaineremertens@gmail.com
Safe HaskellNone
LanguageHaskell2010

Main

Description

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.

Synopsis

Documentation

main :: IO () Source #

Print the answers to part 1 and 2 of day 2's task.

>>> :main
8398
hhvsdkatysmiqjxunezgwcdpr