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

fix(curriculum): clean-up Project Euler 201-220 (#42826)

Browse Source 
* fix: clean-up Project Euler 201-220

* fix: corrections from review

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

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-15 09:20:31 +02:00
committed by GitHub
parent 505c3b7c6c
commit eef1805fe6
20 changed files with 254 additions and 156 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
View File

@ -12,14 +12,18 @@ A robot moves in a series of one-fifth circular arcs (72°), with a free choice
One of 70932 possible closed paths of 25 arcs starting northward is
Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position? (Any arc may be traversed multiple times.)
<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;">
Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
**Note:** Any arc may be traversed multiple times.
# --hints--
`euler208()` should return 331951449665644800.
`robotWalks()` should return `331951449665644800`.
```js
assert.strictEqual(euler208(), 331951449665644800);
assert.strictEqual(robotWalks(), 331951449665644800);
```
# --seed--
@ -27,12 +31,12 @@ assert.strictEqual(euler208(), 331951449665644800);
## --seed-contents--
```js
function euler208() {
function robotWalks() {
return true;
}
euler208();
robotWalks();
```
# --solutions--