Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 931. Minimum Falling Path Sum
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]).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.