A robot is located at the top-left corner of a m x n grid.
The robot can only move either down or right at any point in time.
The robot is trying to reach the bottom-right corner of the grid
How many possible unique paths are there?
Above is a 3 x 7 grid. How many possible unique paths are there?
m and n will be at most 100.
Login to see Answer and Coaching Session
More interview questions