*Hey, it’s your favorite cult leader here 🐱👤*

*On Thursdays, I will send you a problem + its solution. These solutions will help you reinforce your fundamental concepts, improve your problem-solving, and kill those Leetcode-Style Interviews. 🔥🔥💹💹*

*To get access to all my articles and support my crippling chocolate milk addiction, consider subscribing if you haven’t already!*

*p.s. you can learn more about the paid plan here.*

I got nothing clever to say, so let’s get right into it.

This question can be found as Leetcode **62. Unique Paths.**

**Problem**

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`

.

**Example 1:**

```
Input: m = 3, n = 7
Output: 28
```

**Example 2:**

```
Input: m = 3, n = 2
Output: 3
Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Down -> Down
2. Down -> Down -> Right
3. Down -> Right -> Down
```

**Constraints:**

`1 <= m, n <= 100`

## Keep reading with a 7-day free trial

Subscribe to Technology Made Simple to keep reading this post and get 7 days of free access to the full post archives.