62. Unique Paths - LeetCode Solution

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