Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Falling Path Sum
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 1289. Minimum Falling Path Sum II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source