Unique Paths (C# and Python3)

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.

The test cases are generated so that the answer will be less than or equal to 2 * 109.


Start from the flag (star) and count possible paths and return the first element (at the start).

We will start from the ‘start’ in the following code and return the last element (at the flag).



Don’t miss these tips!

We don’t spam! Read our privacy policy for more info.

Open chat
Powered by