2018-10-10 18:03:03 -04:00
---
id: 5900f37b1000cf542c50fe8e
2021-02-06 04:42:36 +00:00
title: 'Problem 15: Lattice paths'
2018-10-10 18:03:03 -04:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301780
2021-01-13 03:31:00 +01:00
dashedName: problem-15-lattice-paths
2018-10-10 18:03:03 -04:00
---
2020-12-16 00:37:30 -07:00
# --description--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Starting in the top left corner of a 2× 2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
< img class = "img-responsive center-block" alt = "a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src = "https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style = "background-color: white; padding: 10px;" / >
How many such routes are there through a given `gridSize` ?
2018-10-10 18:03:03 -04:00
2020-12-16 00:37:30 -07:00
# --hints--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
`latticePaths(4)` should return a number.
```js
assert(typeof latticePaths(4) === 'number');
```
`latticePaths(4)` should return 70.
2018-10-10 18:03:03 -04:00
```js
2020-12-16 00:37:30 -07:00
assert.strictEqual(latticePaths(4), 70);
2018-10-10 18:03:03 -04:00
```
2021-02-06 04:42:36 +00:00
`latticePaths(9)` should return 48620.
2018-10-10 18:03:03 -04:00
2020-12-16 00:37:30 -07:00
```js
assert.strictEqual(latticePaths(9), 48620);
```
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
`latticePaths(20)` should return 137846528820.
2018-10-10 18:03:03 -04:00
```js
2020-12-16 00:37:30 -07:00
assert.strictEqual(latticePaths(20), 137846528820);
2018-10-10 18:03:03 -04:00
```
2020-08-13 17:24:35 +02:00
2021-01-13 03:31:00 +01:00
# --seed--
## --seed-contents--
```js
function latticePaths(gridSize) {
return true;
}
latticePaths(4);
```
2020-12-16 00:37:30 -07:00
# --solutions--
2021-01-13 03:31:00 +01:00
```js
function latticePaths(gridSize) {
let paths = 1;
for (let i = 0; i < gridSize ; i + + ) {
paths *= (2 * gridSize) - i;
paths /= i + 1;
}
return paths;
}
```