← Amazon questions

Minimum Cost Path

Filed under Amazon · Also reported at Chubb Business Services, OYO

Given an M x N grid of non-negative integers, find a path from (0,0) to (M-1, N-1) that minimizes the sum of all numbers along the 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.