Minimum Falling Path Sum
Find the cheapest path that starts in the top row and moves down one row at a time to a column next to or below the previous one. The visual fills a grid with each cell taking its cheapest neighbour above.
Find the cheapest path that starts in the top row and moves down one row at a time to a column next to or below the previous one. The visual fills a grid with each cell taking its cheapest neighbour above.