Given an `n x m` matrix of integers, find the maximum path sum from the top-left cell `(0, 0)` to the bottom-right cell `(n-1, m-1)`. You may only move either 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.