Implement `uniquePaths(m, n)` returning the number of distinct paths from the top-left to the bottom-right of an `m` by `n` grid, moving only right or down.
+ 1 hidden test run on Submit.
Summing top and left contributions across a rolling row gives the count in O(m * n) time, O(n) space.
Run your code to see results.