How should I practice Maximum-Value Grid Path?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Goldman Sachs phone screen problems in FastPrep.

Is Maximum-Value Grid Path associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Maximum-Value Grid Path

Learn this problem

● Medium

Goldman SachsFULLTIMEPHONE SCREEN

Problem statement

Given a nonempty rectangular integer matrix grid, start at its top-left cell and reach its bottom-right cell by moving only one cell right or one cell down.

Collect the value of every visited cell, including both endpoints. Return the maximum total value of a valid path.

Function

maximumGridPathValue(grid: int[][]) → long

Examples

Example 1

grid = [[5,1,2],[4,0,3],[2,7,1]]return = 19

The path 5,4,2,7,1 has total 19.

Example 2

grid = [[-1,-2],[-3,-4]]return = -7

Moving right then down gives -1-2-4=-7.

Constraints

1 <= grid.length, grid[i].length <= 1000
All rows have the same length.
-10^9 <= grid[i][j] <= 10^9
The answer fits in a signed 64-bit integer.