← Goldman Sachs questions
CodingReported in a candidate post, Aug 2021

Maximum path sum in matrix

Filed under Goldman Sachs · Also reported at Danske IT, Tejas Networks

Given an N x M matrix of integers, find the maximum path sum from any cell in the top row to any cell in the bottom row. You can move to adjacent cells (down, down-left, down-right).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.