NeetCode #735LC-931Medium2-D Dynamic Programming
← Back to All Problems#735 · #931 · Minimum Falling Path Sum(下降路径最小和)
📌 Problem Statement & Constraints
Given an
n x n matrix, a falling path starts at any cell of the first row and moves to the next row choosing a column that differs by at most 1. Return the minimum sum of a falling path. Constraints: 1 <= n <= 100, -100 <= matrix[i][j] <= 100.🔒
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!