Max Sum Path in 2D Array
Filed under CarWale
The question
Given a 2D array and an initial position in the first row, find the maximum sum path to travel down to the last row. From a position (i, j), you can move to (i+1, j-1), (i+1, j), or (i+1, j+1), adding the current cell value to the result.
No write-up yet. Related questions below have one.
Related CarWale questions
Collected from public candidate posts and coding forums. Updated Nov 2026.