CT087
Lattice Paths
EasyAcceptance: 0.0%
Starting in the top-left corner of a 2 x 2 grid, there are 6 routes (without backtracking) to the bottom-right corner. Given n, find the number of such routes through an n x n grid.
Example 1:
Input: 2
Output: 6
Example 2:
Input: 20
Output: 137846528820
Example 3:
Input: 10
Output: 184756
Constraints:
1 <= n <= 500
Tags:
math combinatorics grid
Loading...
Test Cases:No test cases
No test cases available.