62. Unique Paths

Practice Unique Paths for free on NudgeCode: Medium, Dynamic Programming pattern. Write it in Python or JavaScript, run the tests in your browser, and ask for a hint when you are stuck.

A robot stands on the top-left cell of an m x n grid and wants to reach the bottom-right cell. Each move goes one cell right or one cell down. Return how many different routes exist.

Example

m = 3, n = 7  ->  28
m = 3, n = 2  ->  3

Constraints

• 1 <= m, n <= 100
• The answer fits in a 32-bit signed integer