Tap here to switch tabs
Problem
Submissions

Problem: Minimum Path Sum

Minimum Path Sum asks you to find the least costly route through a grid of non-negative integers, starting at the top left and reaching the bottom right by moving only right or down.

Statement

You are given an m × n grid containing non-negative integers. Your task is to find a path from the top-left cell to the bottom-right cell that minimizes the sum of the values along the path. At each step, you may move only right or down.

Constraints:

  • m == grid.length

  • n == grid[i].length

  • 1≤1 \leqm, n ≤200\leq 200

  • 0≤0 \leq grid[i][j] ≤200\leq 200

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Path Sum

Minimum Path Sum asks you to find the least costly route through a grid of non-negative integers, starting at the top left and reaching the bottom right by moving only right or down.

Statement

You are given an m × n grid containing non-negative integers. Your task is to find a path from the top-left cell to the bottom-right cell that minimizes the sum of the values along the path. At each step, you may move only right or down.

Constraints:

  • m == grid.length

  • n == grid[i].length

  • 1≤1 \leqm, n ≤200\leq 200

  • 0≤0 \leq grid[i][j] ≤200\leq 200