62. Unique Paths

Dynamic Programming approach
Time:  O(N*M)
Space: O(N*M)

Author: SteffiKeranJ

Dynamic-Programming/uniquePaths.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int uniquePaths(int m, int n) {
+        vector<vector<int>> dp(m+1, vector(n+1, 0));
+        for(int i = 0; i < m; ++i) {
+            dp[i][0] = 1;
+        }
+        for(int j = 0; j < n; ++j) {
+            dp[0][j] = 1;
+        }
+        for(int i = 1 ; i < m; ++i) {
+                for(int j =1 ; j < n; ++j) {
+                dp[i][j] = dp[i-1][j] + dp[i][j-1];
+            }
+        }
+        return dp[m-1][n-1];
+    }
+};