← OYO questions

Maximum Cost Path in Grid

Filed under OYO

Given an M x N grid of integers, find the maximum path sum starting from any cell in the top row to any cell in the bottom row. From cell (r, c), you can move to (r + 1, c - 1), (r + 1, c), or (r + 1…

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

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