Leetcode 1289. Minimum Falling Path Sum II

Given an n×n matrix, pick one element from each row so that no two choices in adjacent rows share a column and return the minimum possible sum; this is an optimization DP problem requiring an O(n^2)-style solution for n up to 200.