Minimum Cost in Grid | Dataford Interview Questions

Find minimum cost in a grid (DP problem)

Asked in the Round 3 - Technical Interview stage. Given a non-empty rectangular grid of non-negative integers, return the minimum cost to travel from the top-left cell to the bottom-right cell. You may move only right or down.

Input and Output

Implement min_cost_grid(grid), where grid is a list of equal-length integer lists. Return the minimum sum of cell costs, including both endpoints.

Constraints

1 <= rows, columns <= 200
0 <= grid[i][j] <= 10^4
All rows have the same length
Moves are restricted to right or down

Function Signature

def min_cost_grid(grid):

Your question is Minimum Cost in Grid. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem