53. Unique Paths in a Grid

Write a function solve that returns the number of possible unique paths to reach bottom-right from top-left in an m x n grid (only moves down or right).

Example:
Input: 3, 7
Output: 28

Run this challenge interactively in Python or JavaScript when the app loads.