Create an Account

Already have account?

Forgot Your Password ?

Home / Questions / Given a m x n grid filled with non-negative numbers, find a path from top left to bottom r...

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1?3?1?1?1 minimizes the sum.

Apr 02 2020 View more View Less

Answer (Solved)

question Subscribe To Get Solution

Related Questions