fix: replace .english.md extension with .md

curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md

@@ -0,0 +1,64 @@
+---
+id: 5900f47c1000cf542c50ff8e
+challengeType: 5
+title: 'Problem 270: Cutting Squares'
+forumTopicId: 301920
+---
+
+## Description
+<section id='description'>
+A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules:
+We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+Two cuts cannot cross, but several cuts can meet at the same border point.
+Proceed until no more legal cuts can be made.
+Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).
+
+
+What is C(30) mod 108 ?
+</section>
+
+## Instructions
+<section id='instructions'>
+
+</section>
+
+## Tests
+<section id='tests'>
+
+```yml
+tests:
+  - text: <code>euler270()</code> should return 82282080.
+    testString: assert.strictEqual(euler270(), 82282080);
+
+```
+
+</section>
+
+## Challenge Seed
+<section id='challengeSeed'>
+
+<div id='js-seed'>
+
+```js
+function euler270() {
+
+  return true;
+}
+
+euler270();
+```
+
+</div>
+
+
+
+</section>
+
+## Solution
+<section id='solution'>
+
+```js
+// solution required
+```
+
+</section>