fix: replace .english.md extension with .md

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md

@@ -0,0 +1,60 @@
+---
+id: 5900f3e41000cf542c50fef6
+challengeType: 5
+title: 'Problem 119: Digit power sum'
+forumTopicId: 301745
+---
+
+## Description
+<section id='description'>
+The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.
+We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.
+You are given that a2 = 512 and a10 = 614656.
+Find a30.
+</section>
+
+## Instructions
+<section id='instructions'>
+
+</section>
+
+## Tests
+<section id='tests'>
+
+```yml
+tests:
+  - text: <code>euler119()</code> should return 248155780267521.
+    testString: assert.strictEqual(euler119(), 248155780267521);
+
+```
+
+</section>
+
+## Challenge Seed
+<section id='challengeSeed'>
+
+<div id='js-seed'>
+
+```js
+function euler119() {
+
+  return true;
+}
+
+euler119();
+```
+
+</div>
+
+
+
+</section>
+
+## Solution
+<section id='solution'>
+
+```js
+// solution required
+```
+
+</section>