Problem Submissions Solution
Distinct Paths
Difficulty: Medium
Acceptance: %
Points: 30.00
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.
Examples:
Expected Time Complexity: O(n^2)
Expected Auxiliary Space: O(n^2)
Constraints:
- 1 <= m, n <= 100
Companies:
Amazon Microsoft Google
Topics:
Array Recursion Dynamic Programming + 1 more
