chore(i8n,learn): processed translations

curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-208-robot-walks.md

@@ -0,0 +1,42 @@
+---
+id: 5900f43f1000cf542c50ff51
+title: 'Problem 208: Robot Walks'
+challengeType: 5
+forumTopicId: 301849
+dashedName: problem-208-robot-walks
+---
+
+# --description--
+
+A robot moves in a series of one-fifth circular arcs (72°), with a free choice of a clockwise or an anticlockwise arc for each step, but no turning on the spot.
+
+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.)
+
+# --hints--
+
+`euler208()` should return 331951449665644800.
+
+```js
+assert.strictEqual(euler208(), 331951449665644800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler208() {
+
+  return true;
+}
+
+euler208();
+```
+
+# --solutions--
+
+```js
+// solution required
+```