Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

833 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f3e21000cf542c50fef4 Problem 117: Red, green, and blue tiles 5 301743 problem-117-red-green-and-blue-tiles

--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.

--hints--

euler117() should return 100808458960497.

assert.strictEqual(euler117(), 100808458960497);

--seed--

--seed-contents--

function euler117() {

  return true;
}

euler117();

--solutions--

// solution required