Practice Minimum Falling Path Sum

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#931

LeetCode Problem

Minimum Falling Path Sum

Array Dynamic Programming Matrix

Problem Statement

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right. Specifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, col + 1).

Source: Minimum Falling Path Sum on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

matrix = [[2,1,3],[6,5,4],[7,8,9]]

Output

# Example 2

Input

matrix = [[-19,57],[-40,-5]]

Output

-59

Constraints

n == matrix.length == matrix[i].length

1 <= n <= 100

-100 <= matrix[i][j] <= 100

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free