MediumDp
Unique Paths
googleamazonmetamicrosoftbloombergapple
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.
Examples
Example 1
Input
m = 3, n = 7
Output
28
The robot must make exactly 2 moves down and 6 moves right (in any order), giving C(8,2) = 28 unique paths.
Example 2
Input
m = 3, n = 2
Output
3
Three paths: RDD, DRD, DDR (where R = right, D = down).
Constraints
- 1 <= m, n <= 100
Optimal complexity
Time
O(m * n)
Space
O(n)
One problem, two ways to prep
Choose between solo practice and interview simulation
Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.