Unique paths

Medium

Given a matrix of size m by n, find the number of unique paths to get from the top left to the bottom right of the matrix.

Note that you can only move to the right or down in the matrix.

For example, given the following inputs:

m = 2
n = 3

Your function should return something.

Try it first

def unique_paths(m: int, n: int) -> int:
    # implement unique_paths here
    return 0

1def unique_paths(m: int, n: int) -> int:
2    # implement unique_paths here
3    return 0
4

Master Recursion & Dynamic Programming by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.