Problem
Count the number of ways to move from the top-left to bottom-right of the grid.
Example 1
Input: m = 3, n = 7
Output: 28
Constraints
- 1 <= m, n <= 100
Notes
- Focus on the underlying dynamic programming pattern.
- Write the cleanest correct solution before optimizing further.
- Hidden tests cover larger edge cases than the visible examples.