aoc2018-0.1.0.0: Advent of Code 2018 solutions and auto-runner

Copyright(c) Justin Le 2018
LicenseBSD3
Maintainerjustin@jle.im
Stabilityexperimental
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

AOC.Challenge.Day03

Description

Day 3. See AOC.Solver for the types used in this module!

Synopsis

Documentation

day03a :: [Rect] :~> Int Source #

Lends itself pretty well to a functional approach.

  1. Lay the tiles.
  2. Get all the frequencies at each time
  3. Filter for the frequencies greater than 2
  4. Count them

day03b :: [Claim] :~> Int Source #

Once we lay our tiles, we find the first claim that has no overlaps.