← Flipkart questions

Maximum sum path in a 2D matrix

Filed under Flipkart

Given an `m x n` matrix of integers, find the maximum sum of a path from the top-left cell (0,0) to the bottom-right cell (m-1, n-1). You can only move down or right at any step.

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 Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.