← Paytm questions

Min Cost Path

Filed under Paytm · Also reported at EagleView

Given a 2D matrix of integers, find the maximum cost 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 point in time.

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

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