Leetcode 1289. Minimum Falling Path Sum II

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1289. Minimum Falling Path Sum II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact