← Amazon questions

Minimum Path Sum

Filed under Amazon · Also reported at Arcesium, Dream11, Goldman Sachs, Tesla, UNcover Wellness

Given a m x n grid filled with non-negative numbers, find a path from the top-left to the bottom-right, which minimizes the sum of all numbers along its path. You can only move either down or right at…

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.