gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(curriculum): clean-up Project Euler 181-200 (#42819)

Browse Source 
* fix: clean-up Project Euler 181-200

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

* fix: missing delimiter

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-15 15:52:14 +02:00
committed by GitHub
parent a9418a1fe9
commit 5a52c229f5
19 changed files with 204 additions and 144 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
View File

@ -14,16 +14,22 @@ During an n-day period a trinary string is formed for each child consisting of L
Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:
OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA LAOO LAOA LAAO
```
OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
LAOO LAOA LAAO
```
How many "prize" strings exist over a 30-day period?
# --hints--
`euler191()` should return 1918080160.
`prizeStrings()` should return `1918080160`.
```js
assert.strictEqual(euler191(), 1918080160);
assert.strictEqual(prizeStrings(), 1918080160);
```
# --seed--
@ -31,12 +37,12 @@ assert.strictEqual(euler191(), 1918080160);
## --seed-contents--
```js
function euler191() {
function prizeStrings() {
return true;
}
euler191();
prizeStrings();
```
# --solutions--