Create 62(DP).cpp

RokibulHasan7 · web-flow · commit 0ce3cf50e02b · 2022-02-22T13:27:35.000+06:00
diff --git a/Solutions/62(DP).cpp b/Solutions/62(DP).cpp
@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int uniquePaths(int m, int n) {
+        vector<vector<int>> dp(m, vector<int> (n));
+        for(int i = m - 1; i >= 0; i--){
+            for(int j = n - 1; j >= 0; j--){
+                if(i == m - 1 && j == n - 1){
+                    dp[i][j] = 1;
+                }
+                else if(i == m - 1){
+                    dp[i][j] = dp[i][j + 1];
+                }
+                else if(j == n - 1){
+                    dp[i][j] = dp[i + 1][j];
+                }
+                else{
+                    dp[i][j] = dp[i + 1][j] + dp[i][j + 1];
+                }
+            }
+        }
+        return dp[0][0];
+    }
+};
+
+// Bottom-Up DP
