freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-364-comfortable-dis...

---
id: 5900f4d91000cf542c50ffea
title: 'Problem 364: Comfortable distance'
challengeType: 5
forumTopicId: 302025
---

# --description--

There are N seats in a row. N people come after each other to fill the seats according to the following rules:

If there is any seat whose adjacent seat(s) are not occupied take such a seat.

If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.

Otherwise take one of the remaining available seats.

Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.

We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.

# --hints--

`euler364()` should return 44855254.

```js
assert.strictEqual(euler364(), 44855254);
```

# --seed--

## --seed-contents--

```js
function euler364() {

  return true;
}

euler364();
```

# --solutions--

```js
// solution required
```
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`---`
			`id: 5900f4d91000cf542c50ffea`
			`title: 'Problem 364: Comfortable distance'`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`challengeType: 5`
fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558) 2019-08-05 16:17:33 +00:00			`forumTopicId: 302025`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`---`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --description--`

feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`There are N seats in a row. N people come after each other to fill the seats according to the following rules:`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`If there is any seat whose adjacent seat(s) are not occupied take such a seat.`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00
fix(challenge-md): Fix quotes that failed in the transform 2018-10-08 00:01:53 +00:00			`Otherwise take one of the remaining available seats.`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			`Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --hints--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`euler364()` should return 44855254.
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			```js
			`assert.strictEqual(euler364(), 44855254);`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --seed--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`## --seed-contents--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			```js
			`function euler364() {`
fix: remove Good luck! comment from challenge seed code (#39575) 2020-09-15 16:57:40 +00:00
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00			`return true;`
			`}`

			`euler364();`
			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 18:02:05 +00:00			`# --solutions--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 22:01:58 +00:00
			```js
			`// solution required`
			```