← All problems

Unique Paths

medium

A robot starts at the top-left corner of an m x n grid and can only move right or down. Return how many distinct paths lead to the bottom-right corner.

Example

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