MinimumPathSum.py

# Question link - https://leetcode.com/problems/minimum-path-sum/description/?envType=study-plan-v2&envId=top-interview-150

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        # Let get the dimension for the grid 
        ROWS , COLS = len(grid) , len(grid[0])

        # Let make the grid for gthe burte approch 
        res = [[float("inf")] * (COLS + 1) for i in range(ROWS + 1)]
        # Initalize value for the calculation
        res[ROWS - 1][COLS] = 0

        # Traverse the grid -> Brute force approch 
        for r in range(ROWS - 1, -1 , -1):
            for c in range(COLS - 1, -1 ,-1):
                # To get the min value, at ith index value.
                res[r][c] = grid[r][c] + min(res[r + 1][c] , res[r][c + 1])

        # Return the value at top left -> min path sum 
        return res[0][0]