Module aoc::y23d13

source ·
Expand description

Advent of Code 2023 Day 13: https://adventofcode.com/2023/day/13

Today’s problem was fairly challenging and I spent quite a bit of time figuring out exactly how to loop through all of the possible valid windows. In part two the key insight is that compared to part one when checking the equality of the rows/columns where there should be zero differences in part two there should be exactly one (which means that we shouldn’t count the old path from part one).

Functions§

  • The solution for the day thirteen challenge.