Create MinimumPathSum.cpp

Author: YashGosaliya

20. Dynamic Programming/MinimumPathSum.cpp

@@ -0,0 +1,21 @@
+//Problem Link:
+//https://leetcode.com/problems/minimum-path-sum/
+
+//Standard DP Approach by using memoization
+
+class Solution {
+public:
+    int minPathSum(vector<vector<int>>& grid) {
+        int m = grid.size();
+        int n = grid[0].size();
+        vector<int> dp(m, grid[0][0]);
+        for (int i = 1; i < m; i++)
+            dp[i] = dp[i - 1] + grid[i][0]; 
+        for (int j = 1; j < n; j++) {
+            dp[0] += grid[0][j]; 
+            for (int i = 1; i < m; i++)
+                dp[i] = min(dp[i - 1], dp[i]) + grid[i][j];
+        }
+        return dp[m - 1];
+    }
+};