There is a scholar on an m x n grid. The scholar is initially located at the top-left corner (i.e., grid[0][0]). The scholar tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The scholar can only move either down or right at any point in time.
Given the two integers m and n, return the number of possible distinct paths that the scholar can take to reach the bottom-right corner.
Example 1
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
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Your submissions, results and runtime history live here. Sign in to start your streak.
3 7
28
3 2
3
15 10
817190