NeetCode #758LC-1289Hard2-D Dynamic Programming
← Back to All Problems#758 · #1289 · Minimum Falling Path Sum II(下降路径最小和 II)
📌 Problem Statement & Constraints
Given an
n x n grid, a falling path picks one cell per row, and the column chosen in row r + 1 must differ from the column chosen in row r. Return the minimum sum of a falling path. Constraints: 1 <= n <= 200, -99 <= grid[i][j] <= 99.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!