← Goldman Sachs questions

Optimal Path for Coin Collection

Filed under Goldman Sachs

Given an M x N grid with non-negative integers representing coins, find the maximum number of coins collected moving only North (up) and East (right) from (M-1, 0) to (0, N-1).

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.