Unique Paths — Medium Coding Interview Question

Return the number of unique paths from top-left to bottom-right of an m x n grid moving only right or down.

Example

Input: m = 3, n = 7

Output: 28

Constraints

• 1 <= m, n <= 100

Topics & Companies

Topics: dp

Asked by: Google, Amazon

Optimal Solution Complexity

Time complexity: O(m*n). Space complexity: O(n).

Practice more

• All DSA Problems
• DSA Patterns