Maximum path sum in a matrix with diagonal/down moves
Filed under PhonePe
The question
Given an N*M matrix filled with integers, find the maximum path sum starting from any cell in the first row to any cell in the last row, moving only down, down-left diagonal, or down-right diagonal.
No write-up yet. Related questions below have one.
Related PhonePe questions
Collected from public candidate posts and coding forums. Updated Nov 2026.