Merge pull request #15 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/62. Unique Paths/62. Unique Paths.py

@@ -0,0 +1,11 @@
+class Solution:
+    def uniquePaths(self, m: int, n: int) -> int:
+        f = [[0] * n for _ in range(m)]
+        f[0][0] = 1
+        for i in range(m):
+            for j in range(n):
+                if i:
+                    f[i][j] += f[i - 1][j]
+                if j:
+                    f[i][j] += f[i][j - 1]
+        return f[-1][-1]