← Goldman Sachs questions

Maximum Sum Path in Matrix from Bottom-Right to Top-Left

Filed under Goldman Sachs

Given a 2D matrix of integers, find the maximum sum path starting from the bottom-right cell (matrix[m-1][n-1]) and ending at the top-left cell (matrix[0][0]), moving only up or left at each step.

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.