freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.en.md

---
id: 5900f3e21000cf542c50fef4
challengeType: 5
title: 'Problem 117: Red, green, and blue tiles'
---

## Description
<section id='description'>
Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways.















































































How many ways can a row measuring fifty units in length be tiled?
NOTE: This is related to Problem 116.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
- text: <code>euler117()</code> should return 100808458960497.
  testString: 'assert.strictEqual(euler117(), 100808458960497, ''<code>euler117()</code> should return 100808458960497.'');'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler117() {
  // Good luck!
  return true;
}

euler117();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>