Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.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

45 lines
884 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f4431000cf542c50ff56
title: 'Problem 215: Crack-free Walls'
challengeType: 5
forumTopicId: 301857
dashedName: problem-215-crack-free-walls
---
# --description--
Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal×vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a "running crack".
For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.
Calculate W(32,10).
# --hints--
`euler215()` should return 806844323190414.
```js
assert.strictEqual(euler215(), 806844323190414);
```
# --seed--
## --seed-contents--
```js
function euler215() {
return true;
}
euler215();
```
# --solutions--
```js
// solution required
```