Problem 1289 · Hard

Minimum Falling Path Sum II

Build the falling path row by row, keeping the best value in every column except the one being filled.

Open the interactive visualisation