# Leetcode 64 - Min path sum

Note:

• DFS
• Don’t worry about visiting a visited cell coz we use memo to remmeber the min path that goes through this cell.
• DP
• dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1])
• Intialize first row and first col coz they don’t fit above deduction.

Question:

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.

Example:

Code:

DFS