Unique Paths · Coding Interview Practice

Unique PathsA robot moves only right or down on an m x n grid. Return how many unique paths reach the bottom-right corner.Constraints

1 <= m, n <= 100

The answer fits in a 32-bit integer

Examples

Input: m = 3, n = 7 Output: 28

Input: m = 3, n = 2 Output: 3

LetsDiscuss

Loading your session…