Day-21 q3: Unique Paths

[div910]

Unique Paths

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

[Tech-neophyte]

Please assign this question to me @bh-g @kratika-Jangid @karishma-2020

[aishwarya-chandra]

please assign this question to me

[namitabagri]

Pls assign this issue to me @bh-g

[Shubh-Krishna]

please assign this question to me :) @bh-g

[Karnankita04]

@bh-g please assign this issue to me :)