15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 931 · Solution & editorial
Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.
Minimum Falling Path Sum is a Dynamic Programming (DP) Patterns problem, in the 2D Array (Unique Paths on Grid) subpattern. The pattern covers fibonacci, Kadane, knapsack, LCS, LIS, edit distance, grid paths, and word break
Count paths and find optimal paths in grids using 2D dynamic programming.
The reference solution runs in O(n^2) time and O(1) space.
Minimum Falling Path Sum has been reported in interviews at Amazon.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Minimum Falling Path Sum is a Dynamic Programming (DP) Patterns problem, in the 2D Array (Unique Paths on Grid) subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.