> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-falling-path-sum.md).

# Minimum Falling Path Sum

Given a **square** array of integers `A`, we want the **minimum** sum of a *falling path* through `A`.

A falling path starts at any element in the first row, and chooses one element from each row.  The next row's choice must be in a column that is different from the previous row's column by at most one.

**Example 1:**

```
Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: 12
Explanation: 
The possible falling paths are:
```

* `[1,4,7], [1,4,8], [1,5,7], [1,5,8], [1,5,9]`
* `[2,4,7], [2,4,8], [2,5,7], [2,5,8], [2,5,9], [2,6,8], [2,6,9]`
* `[3,5,7], [3,5,8], [3,5,9], [3,6,8], [3,6,9]`

The falling path with the smallest sum is `[1,4,7]`, so the answer is `12`.

**Note:**

1. `1 <= A.length == A[0].length <= 100`
2. `-100 <= A[i][j] <= 100`

```java
class Solution {
    public int minFallingPathSum(int[][] A) {
        // dp[i][j] shows min fall path from this element
        int[][] dp = new int[A.length][A.length];
        // bottum up approach
        for (int i = A.length - 1; i >= 0; i--) {
            for (int j = 0; j < A.length; j++) {
                dp[i][j] = A[i][j];
                if(i==A.length-1)
                    continue; // base case
                if (j == 0)
                    dp[i][j] += Math.min(dp[i + 1][j], dp[i + 1][j + 1]);
                else if (j == A.length - 1)
                    dp[i][j] += Math.min(dp[i + 1][j - 1], dp[i + 1][j]);
                else
                    dp[i][j] += Math.min(dp[i + 1][j], Math.min(dp[i + 1][j - 1], dp[i + 1][j + 1]));
            }
        }
        // finding min from first row
        int min = Integer.MAX_VALUE;
        for (int x : dp[0])
            min = Math.min(x, min);
        return min;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-falling-path-sum.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.