Available question text
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]).
Related questions
Continue with questions that share topics or the same question type.
- Minimum Falling Path Sum II
Coding
- Minimum Path Sum
Coding · Array · Dynamic Programming · Matrix
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Determine the Minimum Sum of a k-avoiding Array
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 931. Minimum Falling Path Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source