Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Maximum path sum that starting with any cell of 0-th row and ending with any cell of (N-1)-th row

  • Difficulty Level : Medium
  • Last Updated : 02 Jul, 2021

Given a N X N matrix Mat[N][N] of positive integers. There are only three possible moves from a cell (i, j) 
 

  1. (i+1, j)
  2. (i+1, j-1)
  3. (i+1, j+1)

Starting from any column in row 0, return the largest sum of any of the paths up to row N-1.
Examples: 
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input : mat[4][4] = { {4, 2, 3, 4},
                      {2, 9, 1, 10},
                      {15, 1, 3, 0},
                      {16, 92, 41, 44} };
Output :120
path : 4 + 9 + 15 + 92 = 120

Asked in: Amazon interview 
 



The above problem can be recursively defined.
Let initial position be MaximumPathSum(N-1, j), where j varies from 0 to N-1. We return maximum value between all path that we start traversing (N-1, j) [ where j varies from 0 to N-1] 
 

i = N-1, j = 0 to N -1
int MaximumPath(Mat[][N], I, j)
 
  // IF we reached to first row of 
  // matrix then return value of that 
  // element  
  IF ( i == 0 && j = 0 )
  return    Mat[i][j]

  // out of matrix bound 
  IF( i = N || j < 0 )
   return 0;

  // call all rest position that we reached
  // from current position and find maximum 
  // between them and add current value in 
  // that path 
  return max(MaximumPath(Mat, i-1, j), 
             MaximumPath(Mat, i-1, j-1), 
             MaximumPath(Mat, i-1, j+1)))
             + Mat[i][j];

If we draw recursion tree of above recursive solution, we can observe overlapping subproblems. Since the problem has overlapping subproblems, we can solve it efficiently using Dynamic Programming. Below is Dynamic Programming based solution. 
 

C++




// C++ program to find Maximum path sum
// start any column in row '0' and ends
// up to any column in row 'n-1'
#include<bits/stdc++.h>
using namespace std;
#define N 4
 
// function find maximum sum path
int MaximumPath(int Mat[][N])
{
    int result = 0 ;
 
    // create 2D matrix to store the sum
    // of the path
    int dp[N][N+2];
 
    // initialize all dp matrix as '0'
    memset(dp, 0, sizeof(dp));
 
    // copy all element of first column into
    // 'dp' first column
    for (int i = 0 ; i < N ; i++)
        dp[0][i+1] = Mat[0][i];
 
    for (int i = 1 ; i < N ; i++)
        for (int j = 1 ; j <= N ; j++)
            dp[i][j] = max(dp[i-1][j-1],
                           max(dp[i-1][j],
                               dp[i-1][j+1])) +
                       Mat[i][j-1] ;
 
    // Find maximum path sum that end ups
    // at  any column of last row 'N-1'
    for (int i=0; i<=N; i++)
        result = max(result, dp[N-1][i]);
 
    // return maximum sum path
    return result ;
}
 
// driver program to test above function
int main()
{
    int Mat[4][4] = { { 4, 2 , 3 , 4 },
        { 2 , 9 , 1 , 10},
        { 15, 1 , 3 , 0 },
        { 16 ,92, 41, 44 }
    };
 
    cout << MaximumPath ( Mat ) <<endl ;
    return 0;
}
Java



// Java program to find Maximum path sum
// start any column in row '0' and ends
// up to any column in row 'n-1'
import java.util.*;
 
class GFG {
     
    static int N = 4;
 
    // function find maximum sum path
    static int MaximumPath(int Mat[][])
    {
        int result = 0;
 
        // create 2D matrix to store the sum
        // of the path
        int dp[][] = new int[N][N + 2];
 
        // initialize all dp matrix as '0'
        for (int[] rows : dp)
            Arrays.fill(rows, 0);
 
        // copy all element of first column into
        // 'dp' first column
        for (int i = 0; i < N; i++)
            dp[0][i + 1] = Mat[0][i];
 
        for (int i = 1; i < N; i++)
            for (int j = 1; j <= N; j++)
                dp[i][j] = Math.max(dp[i - 1][j - 1],
                                    Math.max(dp[i - 1][j],
                                    dp[i - 1][j + 1])) +
                                    Mat[i][j - 1];
 
        // Find maximum path sum that end ups
        // at any column of last row 'N-1'
        for (int i = 0; i <= N; i++)
            result = Math.max(result, dp[N - 1][i]);
 
        // return maximum sum path
        return result;
    }
     
    // driver code
    public static void main(String arg[])
    {
        int Mat[][] = { { 4, 2, 3, 4 },
                        { 2, 9, 1, 10 },
                        { 15, 1, 3, 0 },
                        { 16, 92, 41, 44 } };
 
        System.out.println(MaximumPath(Mat));
    }
}
 
// This code is contributed by Anant Agarwal.
Python3



# Python3 program to find
# Maximum path sum
# start any column in
# row '0' and ends
# up to any column in row 'n-1'
 
N = 4
 
# function find maximum sum path
def MaximumPath(Mat):
 
    result = 0
 
    # create 2D matrix to store the sum
    # of the path
    # initialize all dp matrix as '0'
    dp = [[0 for i in range(N+2)] for j in range(N)]
 
    # copy all element of first column into
    # dp first column
    for i in range(N):
        for j in range(1, N+1):
            dp[i][j] = max(dp[i-1][j-1],
                           max(dp[i-1][j],
                               dp[i-1][j+1])) + \
                       Mat[i][j-1]
 
    # Find maximum path sum that end ups
    # at any column of last row 'N-1'
    for i in range(N+1):
        result = max(result, dp[N-1][i])
 
    # return maximum sum path
    return result
 
# driver program to test above function
Mat = [[4, 2, 3, 4],
       [2, 9, 1, 10],
       [15, 1, 3, 0],
       [16, 92, 41, 44]]
 
print(MaximumPath(Mat))
 
# This code is contributed by Soumen Ghosh.
C#



// C# program to find Maximum path sum
// start any column in row '0' and ends
// up to any column in row 'n-1'
using System;
 
class GFG {
     
    static int N = 4;
 
    // function find maximum sum path
    static int MaximumPath(int [,] Mat)
    {
        int result = 0;
 
        // create 2D matrix to store the sum
        // of the path
        int [,]dp = new int[N,N + 2];
 
        // initialize all dp matrix as '0'
        //for (int[] rows : dp)
        //    Arrays.fill(rows, 0);
 
        // copy all element of first column into
        // 'dp' first column
        for (int i = 0; i < N; i++)
            dp[0,i + 1] = Mat[0,i];
 
        for (int i = 1; i < N; i++)
            for (int j = 1; j <= N; j++)
                dp[i,j] = Math.Max(dp[i - 1,j - 1],
                                    Math.Max(dp[i - 1,j],
                                    dp[i - 1,j + 1])) +
                                    Mat[i,j - 1];
 
        // Find maximum path sum that end ups
        // at any column of last row 'N-1'
        for (int i = 0; i <= N; i++)
            result = Math.Max(result, dp[N - 1,i]);
 
        // return maximum sum path
        return result;
    }
     
    // driver code
    public static void Main()
    {
        int [,]Mat = { { 4, 2, 3, 4 },
                        { 2, 9, 1, 10 },
                        { 15, 1, 3, 0 },
                        { 16, 92, 41, 44 } };
 
        Console.WriteLine(MaximumPath(Mat));
    }
}
 
// This code is contributed by Ryuga.
PHP



<?php
// PHP program to find Maximum path sum
// start any column in row '0' and ends
// up to any column in row 'n-1'
$N = 4;
 
// function find maximum sum path
function MaximumPath(&$Mat)
{
    global $N;
    $result = 0;
 
    // create 2D matrix to store the sum
    // of the path
    $dp = array_fill(0, $N,
          array_fill(0, $N + 2, NULL));
 
    // copy all element of first column
    // into 'dp' first column
    for ($i = 0 ; $i < $N ; $i++)
        $dp[0][$i + 1] = $Mat[0][$i];
 
    for ($i = 1 ; $i < $N ; $i++)
        for ($j = 1 ; $j <= $N ; $j++)
            $dp[$i][$j] = max($dp[$i - 1][$j - 1],
                          max($dp[$i - 1][$j],
                              $dp[$i - 1][$j + 1])) +
                              $Mat[$i][$j - 1] ;
 
    // Find maximum path sum that end ups
    // at any column of last row 'N-1'
    for ($i = 0; $i <= $N; $i++)
        $result = max($result, $dp[$N - 1][$i]);
 
    // return maximum sum path
    return $result ;
}
 
// Driver Code
$Mat = array(array(4, 2 , 3 , 4),
             array(2 , 9 , 1 , 10),
             array(15, 1 , 3 , 0),
             array(16 ,92, 41, 44));
 
echo MaximumPath ($Mat) . "\n" ;
 
// This code is contributed by ita_c
?>
Javascript



<script>
 
// Javascript program to find Maximum path sum
// start any column in row '0' and ends
// up to any column in row 'n-1'
     
    let N = 4;
     
    // function find maximum sum path
    function MaximumPath(Mat)
    {
        let result = 0;
   
        // create 2D matrix to store the sum
        // of the path
        let dp = new Array(N);
         
        // initialize all dp matrix as '0'
        for(let i=0;i<N;i++)
        {
            dp[i]=new Array(N+2);
            for(let j=0;j<N+2;j++)
            {
                dp[i][j]=0;
            }
        }
         
   
        // copy all element of first column into
        // 'dp' first column
        for (let i = 0; i < N; i++)
            dp[0][i + 1] = Mat[0][i];
   
        for (let i = 1; i < N; i++)
            for (let j = 1; j <= N; j++)
                dp[i][j] = Math.max(dp[i - 1][j - 1],
                                    Math.max(dp[i - 1][j],
                                    dp[i - 1][j + 1])) +
                                    Mat[i][j - 1];
   
        // Find maximum path sum that end ups
        // at any column of last row 'N-1'
        for (let i = 0; i <= N; i++)
            result = Math.max(result, dp[N - 1][i]);
   
        // return maximum sum path
        return result;
    }
     
    // driver code
    let Mat = [[4, 2, 3, 4],
       [2, 9, 1, 10],
       [15, 1, 3, 0],
       [16, 92, 41, 44]]
    document.write(MaximumPath(Mat))
      
    // This code is contributed by rag2127
     
</script>
Output: 
120
Time complexity : O(N2) 
This article is contributed by Nishant Singh . If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 



My Personal Notes
arrow_drop_up
Previous
Maximum subarray sum in an array created after repeated concatenation
Next

Minimize the maximum difference between the heights
Recommended Articles
Page :
Maximum weight path ending at any element of last row in a matrix
13, Nov 16
Check if a path exists for a cell valued 1 to reach the bottom right corner of a Matrix before any cell valued 2
07, Sep 20
Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
04, May 20
Shortest path from a source cell to a destination cell of a Binary Matrix through cells consisting only of 1s
17, Mar 21
Length of the longest path ending at vertex V in a Graph
16, Mar 21
Minimum moves taken to move coin of each cell to any one cell of Matrix
19, May 20
Minimum number of flips required such that the last cell of matrix can be reached from any other cell
18, Nov 20
Check if a path exists from a given cell to any boundary element of the Matrix with sum of elements not exceeding K
31, Mar 21
Final direction after visiting every cell of Matrix starting from (0, 0)
02, Jul 20
Number of shortest paths to reach every cell from bottom-left cell in the grid
14, Aug 19
Farthest cell from a given cell in a Matrix
22, Jan 21
Represent a number as the sum of positive numbers ending with 9
01, Sep 20
Maximum XOR of a path from top-left to bottom-right cell of given Matrix
25, Oct 20
Find sum of all elements in a matrix except the elements in row and/or column of given cell?
28, Jul 15
Maximize path sum from top-left cell to all other cells of a given Matrix
06, Oct 20
Find length of the longest consecutive path from a given starting character
20, Aug 15
Check if any row of the matrix can be converted to the elements present in the target row
19, Oct 21
Path to reach border cells from a given cell in a 2D Grid without crossing specially marked cells
28, Jun 21
Maximum sum of any submatrix of a Matrix which is sorted row-wise and column-wise
10, Aug 20
Minimum row or column swaps required to make every pair of adjacent cell of a Binary Matrix distinct
07, Jan 21
Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
03, Jul 20
Queries to calculate sum of array elements present at every Yth index starting from the index X
13, Jan 21
Check if row-major order path of Matrix is palindrome or not
20, Jun 20
Print all possible paths from the first row to the last row in a 2D array
03, Jan 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox