lec10_25.cpp

class Solution {
    public:
        int f(int i, int j, vector<vector<int>>& grid,vector<vector<int>>& dp) {
            if (i == 0 && j == 0) return grid[i][j]; // Base case: starting cell
            if (i < 0 || j < 0) return INT_MAX; // Out of bounds, return large value
            if(dp[i][j]!=-1) return dp[i][j];
            int up = f(i - 1, j, grid,dp);
            int left = f(i, j - 1, grid,dp);
    
            return dp[i][j] = grid[i][j] + min(up, left);
        }
    
        int minPathSum(vector<vector<int>>& grid) {
            
            int n = grid.size();
            int m = grid[0].size();
            vector<vector<int>> dp(n ,vector<int>(m ,-1));
            return f(n - 1, m - 1, grid,dp);
        }
    };