← Amazon questions

Find path with maximum candies in a matrix

Filed under Amazon

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

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.