Time: 0 ms (100.00%) | Memory: 17.8 MB (65.05%) - LeetSync

Author: joshua-dierickse-alt

62-unique-paths/unique-paths.py

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