Coding Challenge

Unique Paths

Medium
dynamic-programminggrid

Count robot paths from top-left to bottom-right in a grid.

A robot moves only right or down in an m x n grid. Return the number of unique paths from the top-left to the bottom-right corner.

Examples

Input: m = 3, n = 7

Output: 28

Constraints

  • 1 <= m, n

Preparing your coding workspace...