Unique Paths

Author: TonyKim9401

unique-paths/TonyKim9401.java

@@ -0,0 +1,18 @@
+// TC: O (m * n)
+// SC: O (m * n)
+// -> need to retrieve all elements
+class Solution {
+    public int uniquePaths(int m, int n) {
+        int[][] dp = new int[m][n];
+
+        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];
+    }
+}