Time: 0 ms (100%), Space: 17.7 MB (88.75%) - LeetHub

Author: wlsgur11

0062-unique-paths/0062-unique-paths.py

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