← Amazon questions

Path with highest sum in a matrix with obstacles

Filed under Amazon

Given an n x m grid with integer cell values and some inaccessible cells marked as -1, find the maximum possible sum along a path from the top-left cell (0, 0) to the bottom-right cell (n-1, m-1). You…

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.