Medium · Dynamic Programming

Unique Paths

Given the number of rows m and columns n of a grid, return how many distinct paths lead from the top-left cell to the bottom-right cell when every move goes one cell right or one cell down.

{
  "m": 3,
  "n": 3
}

{
  "m": 3,
  "n": 4
}