Module day02

Source
Expand description

§Corruption Checksum

Part two is O(n²) complexity but at least we can reduce by a factor of two by sorting each line first, allowing us to only compare each number against those that are greater. As a minor benefit this makes part one faster too.

Functions§

parse
part1
part2

Type Aliases§

Input 🔒