Back
2D Grid DP
Question 1 of 12
8% Complete
Easy
Unique Paths in an m×n grid moving only right/down.
A
Greedy always go right
B
Binary search rows
C
DFS with backtracking only
D
dp[i][j] = dp[i-1][j] + dp[i][j-1]