It is day fifteen of Advent of Code. Today, we will be finding the cheapest path.
As always, please try to solve the problem before looking at the solution. For all articles in this series, check out this list.
Our input is a square of single-digit costs, and our task…