Unique Paths Problem

Unique Paths Problem — ExecCode Medium DSA Practice

Solve the Unique Paths problem on ExecCode. Free online medium DSA practice in DP. Write and run code in Java, C++, Python — no signup required to run.

Problem description

A robot is located at the top-left corner of an m × n grid. It can move only right or down at each step. The robot wants to reach the bottom-right corner. Return how many unique paths exist from start to finish. Different sequences of moves count as different paths, even if they visit the same cells.

Examples

Input m = 4, n = 4; Output 20. Input m = 3, n = 3; Output 6. Input m = 3, n = 7; Output 28

Constraints

1 ≤ m, n ≤ 100

Practice Unique Paths free on ExecCode. Browse DSA problems, topic map, and placement guides.