text: class Solution:
      def uniquePaths(self, m: int, n: int) -> int:
          if m == n == 1:
              return 1
          
          dp = [[1] * n] * m #[[1] * rows] * cols]
          
          for row in range(1, m):
              for col in range(1, n):
                  dp[row][col] = dp[row-1][col] + dp[row][col-1]
          return dp[-1][-1]
          
  