← Amazon questions

Min Cost Path in a Grid

Filed under Amazon · Also reported at Goldman Sachs

Given an m x n grid filled with non-negative costs, find a path from (0,0) to (m-1, n-1) that minimizes the sum of all numbers along its path. You can only move down 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 Amazon questions

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