← Goldman Sachs questions

Maximum points path in a matrix from lower-left to upper-right

Filed under Goldman Sachs

Given an M x N matrix of positive integers, find the path from the bottom-left corner (M-1, 0) to the top-right corner (0, N-1) that maximizes the sum of elements, moving only up or 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.