loading

Minimum Path Sum — Step-by-Step Visualization

mediumLeetCode #64ArrayDynamic ProgrammingMatrix

Find minimum sum path from top-left to bottom-right moving only right or down.

Algorithm Pattern

2D DP

Key Idea

dp[i][j] = min cost to reach (i,j) from (0,0) moving only right/down.

Step-by-Step Approach

  1. dp[0][0] = grid[0][0]
  2. First row: dp[0][j] = dp[0][j-1] + grid[0][j]
  3. First col: dp[i][0] = dp[i-1][0] + grid[i][0]
  4. dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1])

Related Problems

← All problems