Leetcode 931. Minimum Falling Path Sum

Given an n×n integer matrix, find the minimum sum of any falling path that starts at any element in the first row and moves each step down-left, down, or down-right to the last row — a classic dynamic programming on a grid (n ≤ 100, values in [-100, 100]).