CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
2D Grid DP
Question 1 of 12
8% Complete
Easy
Unique Paths on an m×n grid without obstacles uses which recurrence?
A
dp[i][j] = dp[i-1][j] + dp[i][j-1]
B
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
C
dp[i][j] = dp[i-1][j-1]
D
dp[i][j] = i*j