Unique Paths
#62
Medium
Dynamic Programming
O(m * n)
O(n)
Amazon
Microsoft
Facebook
Bloomberg
Problem Description
There is a robot on an m x n grid. The robot can only move either down or right. How many possible unique paths are there?
There is a robot on an m x n grid. The robot can only move either down or right. How many possible unique paths are there?