Maximum sum path in 2D array with constrained moves
Filed under Samsung
The question
Given a 2D array where you can traverse right, right-up, or right-down with costs equal to cell values, find the maximum sum path and print the starting position.
No write-up yet. Related questions below have one.
Related Samsung questions
Collected from public candidate posts and coding forums. Updated Nov 2026.