class Solution:
def uniquePaths(self, m: int, n: int) -> int:
#Simple dp
#TC: O(mn)
#SC: O(mn)
dp = [1]*n
for i in range(1, m):
for j in range(1, n):
dp[j] = dp[j] + dp[j-1]
return dp[-1]