Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

int uniquePaths(int m, int n) { vector<int> dp (n, 1); for(int i = 1; i<m; i++) for(int j = 1; j<n; j++) dp[j] = dp[j-1] + dp[j]; return dp.back(); }

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.