From 399705a37a69e656de23fb489e2fc0749ac46fc0 Mon Sep 17 00:00:00 2001
From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>
Date: Fri, 26 Jul 2019 19:26:37 -0700
Subject: [PATCH] fix: removed assert msg argument-2 (#36416)
---
.../problem-168-number-rotations.english.md | 2 +-
...can-be-expressed-as-a-sum-of-powers-of-2.english.md | 2 +-
.../problem-17-number-letter-counts.english.md | 6 +++---
...-can-be-formed-by-concatenating-products.english.md | 2 +-
...of-the-squares-of-the-digits-is-a-square.english.md | 2 +-
...igating-numbers-with-few-repeated-digits.english.md | 2 +-
...rent-hollow-square-laminae-can-be-formed.english.md | 2 +-
...-one-two-three-...-distinct-arrangements.english.md | 2 +-
...can-be-expressed-as-a-sum-of-powers-of-2.english.md | 2 +-
...t-angled-triangles-that-share-a-cathetus.english.md | 2 +-
...roblem-177-integer-angled-quadrilaterals.english.md | 2 +-
.../project-euler/problem-178-step-numbers.english.md | 2 +-
...roblem-179-consecutive-positive-divisors.english.md | 2 +-
.../problem-18-maximum-path-sum-i.english.md | 4 ++--
...l-zeros-of-a-function-of-three-variables.english.md | 2 +-
...-of-two-different-colours-can-be-grouped.english.md | 2 +-
.../problem-182-rsa-encryption.english.md | 2 +-
.../problem-183-maximum-product-of-parts.english.md | 2 +-
...blem-184-triangles-containing-the-origin.english.md | 2 +-
.../project-euler/problem-185-number-mind.english.md | 2 +-
.../problem-186-connectedness-of-a-network.english.md | 2 +-
.../project-euler/problem-187-semiprimes.english.md | 2 +-
...-188-the-hyperexponentiation-of-a-number.english.md | 2 +-
...blem-189-tri-colouring-a-triangular-grid.english.md | 2 +-
.../problem-19-counting-sundays.english.md | 6 +++---
...roblem-190-maximising-a-weighted-product.english.md | 2 +-
.../project-euler/problem-191-prize-strings.english.md | 2 +-
.../problem-192-best-approximations.english.md | 2 +-
.../problem-193-squarefree-numbers.english.md | 2 +-
.../problem-194-coloured-configurations.english.md | 2 +-
...f-triangles-with-one-angle-of-60-degrees.english.md | 2 +-
.../problem-196-prime-triplets.english.md | 2 +-
...aviour-of-a-recursively-defined-sequence.english.md | 2 +-
.../problem-198-ambiguous-numbers.english.md | 2 +-
.../problem-199-iterative-circle-packing.english.md | 2 +-
.../problem-2-even-fibonacci-numbers.english.md | 10 +++++-----
.../problem-20-factorial-digit-sum.english.md | 10 +++++-----
...containing-the-contiguous-sub-string-200.english.md | 2 +-
.../problem-201-subsets-with-a-unique-sum.english.md | 2 +-
.../project-euler/problem-202-laserbeam.english.md | 2 +-
...lem-203-squarefree-binomial-coefficients.english.md | 2 +-
.../problem-204-generalised-hamming-numbers.english.md | 2 +-
.../project-euler/problem-205-dice-game.english.md | 2 +-
.../problem-206-concealed-square.english.md | 2 +-
.../problem-207-integer-partition-equations.english.md | 2 +-
.../project-euler/problem-208-robot-walks.english.md | 2 +-
.../problem-209-circular-logic.english.md | 2 +-
.../problem-21-amicable-numbers.english.md | 8 ++++----
.../problem-210-obtuse-angled-triangles.english.md | 2 +-
.../problem-211-divisor-square-sum.english.md | 2 +-
.../problem-212-combined-volume-of-cuboids.english.md | 2 +-
.../project-euler/problem-213-flea-circus.english.md | 2 +-
.../problem-214-totient-chains.english.md | 2 +-
.../problem-215-crack-free-walls.english.md | 2 +-
...e-primality-of-numbers-of-the-form-2n2-1.english.md | 2 +-
.../problem-217-balanced-numbers.english.md | 2 +-
...oblem-218-perfect-right-angled-triangles.english.md | 2 +-
.../problem-219-skew-cost-coding.english.md | 2 +-
.../project-euler/problem-22-names-scores.english.md | 6 +++---
.../problem-220-heighway-dragon.english.md | 2 +-
.../problem-221-alexandrian-integers.english.md | 2 +-
.../problem-222-sphere-packing.english.md | 2 +-
...blem-223-almost-right-angled-triangles-i.english.md | 2 +-
...lem-224-almost-right-angled-triangles-ii.english.md | 2 +-
.../problem-225-tribonacci-non-divisors.english.md | 2 +-
.../problem-226-a-scoop-of-blancmange.english.md | 2 +-
.../project-euler/problem-227-the-chase.english.md | 2 +-
.../problem-228-minkowski-sums.english.md | 2 +-
...m-229-four-representations-using-squares.english.md | 2 +-
.../problem-23-non-abundant-sums.english.md | 8 ++++----
.../problem-230-fibonacci-words.english.md | 2 +-
...e-factorisation-of-binomial-coefficients.english.md | 2 +-
.../project-euler/problem-232-the-race.english.md | 2 +-
.../problem-233-lattice-points-on-a-circle.english.md | 2 +-
.../problem-234-semidivisible-numbers.english.md | 2 +-
75 files changed, 96 insertions(+), 96 deletions(-)
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md
index c495e92248..172443eb13 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md
@@ -23,7 +23,7 @@ Find the last 5 digits of the sum of all integers n, 10 < n < 10100, that have t
```yml
tests:
- text: euler168() should return 59206.
- testString: assert.strictEqual(euler168(), 59206, 'euler168() should return 59206.');
+ testString: assert.strictEqual(euler168(), 59206);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
index 936b50f519..02c0f09ed5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
@@ -26,7 +26,7 @@ What is f(1025)?
```yml
tests:
- text: euler169() should return 178653872807.
- testString: assert.strictEqual(euler169(), 178653872807, 'euler169() should return 178653872807.');
+ testString: assert.strictEqual(euler169(), 178653872807);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-17-number-letter-counts.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-17-number-letter-counts.english.md
index 875e8c8f7d..44241acba3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-17-number-letter-counts.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-17-number-letter-counts.english.md
@@ -22,11 +22,11 @@ If all the numbers from 1 to given limit inclusive were written out
```yml
tests:
- text: numberLetterCounts(5) should return 19.
- testString: assert.strictEqual(numberLetterCounts(5), 19, 'numberLetterCounts(5) should return 19.');
+ testString: assert.strictEqual(numberLetterCounts(5), 19);
- text: numberLetterCounts(150) should return 1903.
- testString: assert.strictEqual(numberLetterCounts(150), 1903, 'numberLetterCounts(150) should return 1903.');
+ testString: assert.strictEqual(numberLetterCounts(150), 1903);
- text: numberLetterCounts(1000) should return 21124.
- testString: assert.strictEqual(numberLetterCounts(1000), 21124, 'numberLetterCounts(1000) should return 21124.');
+ testString: assert.strictEqual(numberLetterCounts(1000), 21124);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.english.md
index 79d3ae40fa..d57678ec58 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.english.md
@@ -29,7 +29,7 @@ What is the largest 0 to 9 pandigital 10-digit concatenated product of an intege
```yml
tests:
- text: euler170() should return 9857164023.
- testString: assert.strictEqual(euler170(), 9857164023, 'euler170() should return 9857164023.');
+ testString: assert.strictEqual(euler170(), 9857164023);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.english.md
index 7aecd6464f..d1d8a6610a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.english.md
@@ -24,7 +24,7 @@ Find the last nine digits of the sum of all n, 0 < n < 1020, such that f(n) is a
```yml
tests:
- text: euler171() should return 142989277.
- testString: assert.strictEqual(euler171(), 142989277, 'euler171() should return 142989277.');
+ testString: assert.strictEqual(euler171(), 142989277);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.english.md
index f80795604a..bba9f849c1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.english.md
@@ -20,7 +20,7 @@ How many 18-digit numbers n (without leading zeros) are there such that no digit
```yml
tests:
- text: euler172() should return 227485267000992000.
- testString: assert.strictEqual(euler172(), 227485267000992000, 'euler172() should return 227485267000992000.');
+ testString: assert.strictEqual(euler172(), 227485267000992000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md
index 9866a6f231..808afb0e5c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md
@@ -24,7 +24,7 @@ Using up to one million tiles how many different square laminae can be formed?
```yml
tests:
- text: euler173() should return 1572729.
- testString: assert.strictEqual(euler173(), 1572729, 'euler173() should return 1572729.');
+ testString: assert.strictEqual(euler173(), 1572729);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.english.md
index 9654d6529a..b6eea3f04f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.english.md
@@ -26,7 +26,7 @@ What is ∑ N(n) for 1 ≤ n ≤ 10?
```yml
tests:
- text: euler174() should return 209566.
- testString: assert.strictEqual(euler174(), 209566, 'euler174() should return 209566.');
+ testString: assert.strictEqual(euler174(), 209566);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
index 3f5f8b7209..0cfcd102b0 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md
@@ -29,7 +29,7 @@ Give your answer as comma separated integers, without any whitespaces.
```yml
tests:
- text: euler175() should return 1, 13717420, 8.
- testString: assert.strictEqual(euler175(), 1, 13717420, 8, 'euler175() should return 1, 13717420, 8.');
+ testString: assert.strictEqual(euler175(), 1, 13717420, 8);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.english.md
index 8437e40247..cd6a3a38d2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.english.md
@@ -21,7 +21,7 @@ Find the smallest integer that can be the length of a cathetus of exactly 47547
```yml
tests:
- text: euler176() should return 96818198400000.
- testString: assert.strictEqual(euler176(), 96818198400000, 'euler176() should return 96818198400000.');
+ testString: assert.strictEqual(euler176(), 96818198400000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.english.md
index 622f520162..369d5216c8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.english.md
@@ -25,7 +25,7 @@ Note: In your calculations you may assume that a calculated angle is integral if
```yml
tests:
- text: euler177() should return 129325.
- testString: assert.strictEqual(euler177(), 129325, 'euler177() should return 129325.');
+ testString: assert.strictEqual(euler177(), 129325);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-178-step-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-178-step-numbers.english.md
index 26b44109d0..4b81d3220a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-178-step-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-178-step-numbers.english.md
@@ -25,7 +25,7 @@ How many pandigital step numbers less than 1040 are there?
```yml
tests:
- text: euler178() should return 126461847755.
- testString: assert.strictEqual(euler178(), 126461847755, 'euler178() should return 126461847755.');
+ testString: assert.strictEqual(euler178(), 126461847755);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md
index 3608abce97..e40111a9fe 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md
@@ -20,7 +20,7 @@ Find the number of integers 1 < n < 107, for which n and n + 1 have the same num
```yml
tests:
- text: euler179() should return 986262.
- testString: assert.strictEqual(euler179(), 986262, 'euler179() should return 986262.');
+ testString: assert.strictEqual(euler179(), 986262);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.english.md
index bcddda37e1..df2260b588 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.english.md
@@ -25,9 +25,9 @@ Find the maximum total from top to bottom of the triangle below:
```yml
tests:
- text: maximumPathSumI(testTriangle) should return 23.
- testString: assert.strictEqual(maximumPathSumI(testTriangle), 23, 'maximumPathSumI(testTriangle) should return 23.');
+ testString: assert.strictEqual(maximumPathSumI(testTriangle), 23);
- text: maximumPathSumI(numTriangle) should return 1074.
- testString: assert.strictEqual(maximumPathSumI(numTriangle), 1074, 'maximumPathSumI(numTriangle) should return 1074.');
+ testString: assert.strictEqual(maximumPathSumI(numTriangle), 1074);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.english.md
index 43fcc8b01c..0069d47eb9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.english.md
@@ -28,7 +28,7 @@ Find u + v.
```yml
tests:
- text: euler180() should return 285196020571078980.
- testString: assert.strictEqual(euler180(), 285196020571078980, 'euler180() should return 285196020571078980.');
+ testString: assert.strictEqual(euler180(), 285196020571078980);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.english.md
index d1c9cfd28d..010f1c7937 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.english.md
@@ -23,7 +23,7 @@ In how many ways can sixty black objects B and forty white objects W be thus gr
```yml
tests:
- text: euler181() should return 83735848679360670.
- testString: assert.strictEqual(euler181(), 83735848679360670, 'euler181() should return 83735848679360670.');
+ testString: assert.strictEqual(euler181(), 83735848679360670);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-182-rsa-encryption.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-182-rsa-encryption.english.md
index c01835ec7d..15d4789486 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-182-rsa-encryption.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-182-rsa-encryption.english.md
@@ -34,7 +34,7 @@ Find the sum of all values of e, 1euler182() should return 399788195976.
- testString: assert.strictEqual(euler182(), 399788195976, 'euler182() should return 399788195976.');
+ testString: assert.strictEqual(euler182(), 399788195976);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.english.md
index fa79e15000..99cc447047 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.english.md
@@ -35,7 +35,7 @@ Find ΣD(N) for 5 ≤ N ≤ 10000.
```yml
tests:
- text: euler183() should return 48861552.
- testString: assert.strictEqual(euler183(), 48861552, 'euler183() should return 48861552.');
+ testString: assert.strictEqual(euler183(), 48861552);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.english.md
index 0938482855..21ff4577a8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.english.md
@@ -26,7 +26,7 @@ How many triangles are there containing the origin in the interior and having al
```yml
tests:
- text: euler184() should return 1725323624056.
- testString: assert.strictEqual(euler184(), 1725323624056, 'euler184() should return 1725323624056.');
+ testString: assert.strictEqual(euler184(), 1725323624056);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-185-number-mind.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-185-number-mind.english.md
index c5d61bf601..e61586e854 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-185-number-mind.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-185-number-mind.english.md
@@ -57,7 +57,7 @@ Find the unique 16-digit secret sequence.
```yml
tests:
- text: euler185() should return 4640261571849533.
- testString: assert.strictEqual(euler185(), 4640261571849533, 'euler185() should return 4640261571849533.');
+ testString: assert.strictEqual(euler185(), 4640261571849533);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.english.md
index 06f5deee15..24add0e3bc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.english.md
@@ -32,7 +32,7 @@ The Prime Minister's phone number is 524287. After how many successful calls, no
```yml
tests:
- text: euler186() should return 2325629.
- testString: assert.strictEqual(euler186(), 2325629, 'euler186() should return 2325629.');
+ testString: assert.strictEqual(euler186(), 2325629);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-187-semiprimes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-187-semiprimes.english.md
index 78314e3598..46cd3f3a41 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-187-semiprimes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-187-semiprimes.english.md
@@ -25,7 +25,7 @@ How many composite integers, n < 108, have precisely two, not necessarily distin
```yml
tests:
- text: euler187() should return 17427258.
- testString: assert.strictEqual(euler187(), 17427258, 'euler187() should return 17427258.');
+ testString: assert.strictEqual(euler187(), 17427258);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.english.md
index e9eeeac547..93747564ca 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.english.md
@@ -25,7 +25,7 @@ Find the last 8 digits of 1777↑↑1855.
```yml
tests:
- text: euler188() should return 95962097.
- testString: assert.strictEqual(euler188(), 95962097, 'euler188() should return 95962097.');
+ testString: assert.strictEqual(euler188(), 95962097);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.english.md
index 4c8a38c2b9..959e384ca3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.english.md
@@ -32,7 +32,7 @@ How many distinct valid colourings are there for the above configuration?
```yml
tests:
- text: euler189() should return 10834893628237824.
- testString: assert.strictEqual(euler189(), 10834893628237824, 'euler189() should return 10834893628237824.');
+ testString: assert.strictEqual(euler189(), 10834893628237824);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-19-counting-sundays.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-19-counting-sundays.english.md
index 8827f15a16..77bc4d46d2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-19-counting-sundays.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-19-counting-sundays.english.md
@@ -22,11 +22,11 @@ How many Sundays fell on the first of the month during the twentieth century (1
```yml
tests:
- text: countingSundays(1943, 1946) should return 6.
- testString: assert.strictEqual(countingSundays(1943, 1946), 6, 'countingSundays(1943, 1946) should return 6.');
+ testString: assert.strictEqual(countingSundays(1943, 1946), 6);
- text: countingSundays(1995, 2000) should return 10.
- testString: assert.strictEqual(countingSundays(1995, 2000), 10, 'countingSundays(1995, 2000) should return 10.');
+ testString: assert.strictEqual(countingSundays(1995, 2000), 10);
- text: countingSundays(1901, 2000) should return 171.
- testString: assert.strictEqual(countingSundays(1901, 2000), 171, 'countingSundays(1901, 2000) should return 171.');
+ testString: assert.strictEqual(countingSundays(1901, 2000), 171);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.english.md
index ec797a873b..7e8304b8ae 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.english.md
@@ -24,7 +24,7 @@ Find Σ[Pm] for 2 ≤ m ≤ 15.
```yml
tests:
- text: euler190() should return 371048281.
- testString: assert.strictEqual(euler190(), 371048281, 'euler190() should return 371048281.');
+ testString: assert.strictEqual(euler190(), 371048281);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-191-prize-strings.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-191-prize-strings.english.md
index 2751a26e22..40e7b7454c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-191-prize-strings.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-191-prize-strings.english.md
@@ -32,7 +32,7 @@ How many "prize" strings exist over a 30-day period?
```yml
tests:
- text: euler191() should return 1918080160.
- testString: assert.strictEqual(euler191(), 1918080160, 'euler191() should return 1918080160.');
+ testString: assert.strictEqual(euler191(), 1918080160);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-192-best-approximations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-192-best-approximations.english.md
index fee519b6a6..d6dc629939 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-192-best-approximations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-192-best-approximations.english.md
@@ -27,7 +27,7 @@ Find the sum of all denominators of the best approximations to √n for the deno
```yml
tests:
- text: euler192() should return 57060635927998344.
- testString: assert.strictEqual(euler192(), 57060635927998344, 'euler192() should return 57060635927998344.');
+ testString: assert.strictEqual(euler192(), 57060635927998344);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-193-squarefree-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-193-squarefree-numbers.english.md
index 785da3cbda..a41d7a01c7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-193-squarefree-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-193-squarefree-numbers.english.md
@@ -22,7 +22,7 @@ How many squarefree numbers are there below 250?
```yml
tests:
- text: euler193() should return 684465067343069.
- testString: assert.strictEqual(euler193(), 684465067343069, 'euler193() should return 684465067343069.');
+ testString: assert.strictEqual(euler193(), 684465067343069);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-194-coloured-configurations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-194-coloured-configurations.english.md
index 871e848afb..ced267bcd3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-194-coloured-configurations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-194-coloured-configurations.english.md
@@ -30,7 +30,7 @@ Find the last 8 digits of N(25,75,1984).
```yml
tests:
- text: euler194() should return 61190912.
- testString: assert.strictEqual(euler194(), 61190912, 'euler194() should return 61190912.');
+ testString: assert.strictEqual(euler194(), 61190912);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.english.md
index e662260c0e..58efa2dba3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.english.md
@@ -26,7 +26,7 @@ Find T(1053779).
```yml
tests:
- text: euler195() should return 75085391.
- testString: assert.strictEqual(euler195(), 75085391, 'euler195() should return 75085391.');
+ testString: assert.strictEqual(euler195(), 75085391);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-196-prime-triplets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-196-prime-triplets.english.md
index 45e51f2df0..dfe9dfde44 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-196-prime-triplets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-196-prime-triplets.english.md
@@ -46,7 +46,7 @@ Find S(5678027) + S(7208785).
```yml
tests:
- text: euler196() should return 322303240771079940.
- testString: assert.strictEqual(euler196(), 322303240771079940, 'euler196() should return 322303240771079940.');
+ testString: assert.strictEqual(euler196(), 322303240771079940);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.english.md
index a26b02000d..f50650a9c7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.english.md
@@ -24,7 +24,7 @@ Give your answer with 9 digits after the decimal point.
```yml
tests:
- text: euler197() should return 1.710637717.
- testString: assert.strictEqual(euler197(), 1.710637717, 'euler197() should return 1.710637717.');
+ testString: assert.strictEqual(euler197(), 1.710637717);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.english.md
index afc9d0d1c6..1a9fa274a5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.english.md
@@ -26,7 +26,7 @@ How many ambiguous numbers x = p/q,
```yml
tests:
- text: euler198() should return 52374425.
- testString: assert.strictEqual(euler198(), 52374425, 'euler198() should return 52374425.');
+ testString: assert.strictEqual(euler198(), 52374425);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
index 801350ceb1..d7036f7116 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.english.md
@@ -28,7 +28,7 @@ Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
```yml
tests:
- text: euler199() should return 0.00396087.
- testString: assert.strictEqual(euler199(), 0.00396087, 'euler199() should return 0.00396087.');
+ testString: assert.strictEqual(euler199(), 0.00396087);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md
index 4a8daef274..fc30c62524 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.english.md
@@ -22,15 +22,15 @@ By considering the terms in the Fibonacci sequence that do not exceed the
```yml
tests:
- text: fiboEvenSum(10) should return 44.
- testString: assert.strictEqual(fiboEvenSum(10), 44, 'fiboEvenSum(10) should return 44.');
+ testString: assert.strictEqual(fiboEvenSum(10), 44);
- text: fiboEvenSum(18) should return 3382.
- testString: assert.strictEqual(fiboEvenSum(18), 3382, 'fiboEvenSum(18) should return 3382.');
+ testString: assert.strictEqual(fiboEvenSum(18), 3382);
- text: fiboEvenSum(23) should return 60696.
- testString: assert.strictEqual(fiboEvenSum(23), 60696, 'fiboEvenSum(23) should return 60696.');
+ testString: assert.strictEqual(fiboEvenSum(23), 60696);
- text: fiboEvenSum(43) should return 350704366.
- testString: assert.strictEqual(fiboEvenSum(43), 350704366, 'fiboEvenSum(43) should return 350704366.');
+ testString: assert.strictEqual(fiboEvenSum(43), 350704366);
- text: Your function should return an even value.
- testString: assert.equal(fiboEvenSum(10) % 2 === 0, true, 'Your function should return an even value.');
+ testString: assert.equal(fiboEvenSum(10) % 2 === 0, true);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.english.md
index 2fd52fd172..b767a341ee 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.english.md
@@ -22,15 +22,15 @@ Find the sum of the digits n!
```yml
tests:
- text: sumFactorialDigits(10) should return 27.
- testString: assert.strictEqual(sumFactorialDigits(10), 27, 'sumFactorialDigits(10) should return 27.');
+ testString: assert.strictEqual(sumFactorialDigits(10), 27);
- text: sumFactorialDigits(25) should return 72.
- testString: assert.strictEqual(sumFactorialDigits(25), 72, 'sumFactorialDigits(25) should return 72.');
+ testString: assert.strictEqual(sumFactorialDigits(25), 72);
- text: sumFactorialDigits(50) should return 216.
- testString: assert.strictEqual(sumFactorialDigits(50), 216, 'sumFactorialDigits(50) should return 216.');
+ testString: assert.strictEqual(sumFactorialDigits(50), 216);
- text: sumFactorialDigits(75) should return 432.
- testString: assert.strictEqual(sumFactorialDigits(75), 432, 'sumFactorialDigits(75) should return 432.');
+ testString: assert.strictEqual(sumFactorialDigits(75), 432);
- text: sumFactorialDigits(100) should return 648.
- testString: assert.strictEqual(sumFactorialDigits(100), 648, 'sumFactorialDigits(100) should return 648.');
+ testString: assert.strictEqual(sumFactorialDigits(100), 648);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.english.md
index c6b5cc9d42..e4aa057ce2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.english.md
@@ -27,7 +27,7 @@ Find the 200th prime-proof sqube containing the contiguous sub-string "200".
```yml
tests:
- text: euler200() should return 229161792008.
- testString: assert.strictEqual(euler200(), 229161792008, 'euler200() should return 229161792008.');
+ testString: assert.strictEqual(euler200(), 229161792008);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.english.md
index c9a51483a5..b2dc080b83 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.english.md
@@ -51,7 +51,7 @@ Determine the sum of all integers which are the sum of exactly one of the 50-ele
```yml
tests:
- text: euler201() should return 115039000.
- testString: assert.strictEqual(euler201(), 115039000, 'euler201() should return 115039000.');
+ testString: assert.strictEqual(euler201(), 115039000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-202-laserbeam.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-202-laserbeam.english.md
index fd6fdae20b..b16e6aa66b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-202-laserbeam.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-202-laserbeam.english.md
@@ -29,7 +29,7 @@ In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surf
```yml
tests:
- text: euler202() should return 1209002624.
- testString: assert.strictEqual(euler202(), 1209002624, 'euler202() should return 1209002624.');
+ testString: assert.strictEqual(euler202(), 1209002624);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.english.md
index 3d8478de2e..cd418c2948 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.english.md
@@ -33,7 +33,7 @@ Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's
```yml
tests:
- text: euler203() should return 34029210557338.
- testString: assert.strictEqual(euler203(), 34029210557338, 'euler203() should return 34029210557338.');
+ testString: assert.strictEqual(euler203(), 34029210557338);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.english.md
index e47e261e23..3799ffbb40 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.english.md
@@ -27,7 +27,7 @@ How many generalised Hamming numbers of type 100 are there which don't exceed 10
```yml
tests:
- text: euler204() should return 2944730.
- testString: assert.strictEqual(euler204(), 2944730, 'euler204() should return 2944730.');
+ testString: assert.strictEqual(euler204(), 2944730);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-205-dice-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-205-dice-game.english.md
index 636da28ac7..d52b23114b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-205-dice-game.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-205-dice-game.english.md
@@ -25,7 +25,7 @@ What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer
```yml
tests:
- text: euler205() should return 0.5731441.
- testString: assert.strictEqual(euler205(), 0.5731441, 'euler205() should return 0.5731441.');
+ testString: assert.strictEqual(euler205(), 0.5731441);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-206-concealed-square.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-206-concealed-square.english.md
index 3ad99612d4..1bbd3de29b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-206-concealed-square.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-206-concealed-square.english.md
@@ -20,7 +20,7 @@ Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,
```yml
tests:
- text: euler206() should return 1389019170.
- testString: assert.strictEqual(euler206(), 1389019170, 'euler206() should return 1389019170.');
+ testString: assert.strictEqual(euler206(), 1389019170);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-207-integer-partition-equations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-207-integer-partition-equations.english.md
index 6593d6b2a4..7e2a0c8474 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-207-integer-partition-equations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-207-integer-partition-equations.english.md
@@ -41,7 +41,7 @@ Find the smallest m for which P(m) < 1/12345
```yml
tests:
- text: euler207() should return 44043947822.
- testString: assert.strictEqual(euler207(), 44043947822, 'euler207() should return 44043947822.');
+ testString: assert.strictEqual(euler207(), 44043947822);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-208-robot-walks.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-208-robot-walks.english.md
index 293ba23484..3e0fb07e77 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-208-robot-walks.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-208-robot-walks.english.md
@@ -27,7 +27,7 @@ Given that the robot starts facing North, how many journeys of 70 arcs in length
```yml
tests:
- text: euler208() should return 331951449665644800.
- testString: assert.strictEqual(euler208(), 331951449665644800, 'euler208() should return 331951449665644800.');
+ testString: assert.strictEqual(euler208(), 331951449665644800);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-209-circular-logic.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-209-circular-logic.english.md
index f2aaa92c60..bcc4c7eb93 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-209-circular-logic.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-209-circular-logic.english.md
@@ -30,7 +30,7 @@ for all 6-bit inputs (a, b, c, d, e, f)?
```yml
tests:
- text: euler209() should return 15964587728784.
- testString: assert.strictEqual(euler209(), 15964587728784, 'euler209() should return 15964587728784.');
+ testString: assert.strictEqual(euler209(), 15964587728784);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-21-amicable-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-21-amicable-numbers.english.md
index 438d390044..c44d085dab 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-21-amicable-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-21-amicable-numbers.english.md
@@ -23,13 +23,13 @@ Evaluate the sum of all the amicable numbers under n.
```yml
tests:
- text: sumAmicableNum(1000) should return 504.
- testString: assert.strictEqual(sumAmicableNum(1000), 504, 'sumAmicableNum(1000) should return 504.');
+ testString: assert.strictEqual(sumAmicableNum(1000), 504);
- text: sumAmicableNum(2000) should return 2898.
- testString: assert.strictEqual(sumAmicableNum(2000), 2898, 'sumAmicableNum(2000) should return 2898.');
+ testString: assert.strictEqual(sumAmicableNum(2000), 2898);
- text: sumAmicableNum(5000) should return 8442.
- testString: assert.strictEqual(sumAmicableNum(5000), 8442, 'sumAmicableNum(5000) should return 8442.');
+ testString: assert.strictEqual(sumAmicableNum(5000), 8442);
- text: sumAmicableNum(10000) should return 31626.
- testString: assert.strictEqual(sumAmicableNum(10000), 31626, 'sumAmicableNum(10000) should return 31626.');
+ testString: assert.strictEqual(sumAmicableNum(10000), 31626);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.english.md
index e15695a0ca..7efecba452 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.english.md
@@ -25,7 +25,7 @@ What is N(1,000,000,000)?
```yml
tests:
- text: euler210() should return 1598174770174689500.
- testString: assert.strictEqual(euler210(), 1598174770174689500, 'euler210() should return 1598174770174689500.');
+ testString: assert.strictEqual(euler210(), 1598174770174689500);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.english.md
index 80959824ff..6e9f8a31af 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-211-divisor-square-sum.english.md
@@ -22,7 +22,7 @@ Find the sum of all n, 0 < n < 64,000,000 such that σ2(n) is a perfect square.
```yml
tests:
- text: euler211() should return 1922364685.
- testString: assert.strictEqual(euler211(), 1922364685, 'euler211() should return 1922364685.');
+ testString: assert.strictEqual(euler211(), 1922364685);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.english.md
index cd80c99ba5..7116e603bd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.english.md
@@ -34,7 +34,7 @@ What is the combined volume of all 50000 cuboids, C1,...,C50000 ?
```yml
tests:
- text: euler212() should return 328968937309.
- testString: assert.strictEqual(euler212(), 328968937309, 'euler212() should return 328968937309.');
+ testString: assert.strictEqual(euler212(), 328968937309);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-213-flea-circus.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-213-flea-circus.english.md
index d00c99c837..a4bc44548a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-213-flea-circus.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-213-flea-circus.english.md
@@ -23,7 +23,7 @@ What is the expected number of unoccupied squares after 50 rings of the bell? Gi
```yml
tests:
- text: euler213() should return 330.721154.
- testString: assert.strictEqual(euler213(), 330.721154, 'euler213() should return 330.721154.');
+ testString: assert.strictEqual(euler213(), 330.721154);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-214-totient-chains.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-214-totient-chains.english.md
index 23a7185623..2fbe455da4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-214-totient-chains.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-214-totient-chains.english.md
@@ -39,7 +39,7 @@ What is the sum of all primes less than 40000000 which generate a chain of lengt
```yml
tests:
- text: euler214() should return 1677366278943.
- testString: assert.strictEqual(euler214(), 1677366278943, 'euler214() should return 1677366278943.');
+ testString: assert.strictEqual(euler214(), 1677366278943);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-215-crack-free-walls.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-215-crack-free-walls.english.md
index d4e895338c..24d880865a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-215-crack-free-walls.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-215-crack-free-walls.english.md
@@ -29,7 +29,7 @@ Calculate W(32,10).
```yml
tests:
- text: euler215() should return 806844323190414.
- testString: assert.strictEqual(euler215(), 806844323190414, 'euler215() should return 806844323190414.');
+ testString: assert.strictEqual(euler215(), 806844323190414);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.english.md
index cc75bb579b..893759b68a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.english.md
@@ -25,7 +25,7 @@ How many numbers t(n) are prime for n ≤ 50,000,000 ?
```yml
tests:
- text: euler216() should return 5437849.
- testString: assert.strictEqual(euler216(), 5437849, 'euler216() should return 5437849.');
+ testString: assert.strictEqual(euler216(), 5437849);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-217-balanced-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-217-balanced-numbers.english.md
index dcfdfc061d..ca6365dfee 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-217-balanced-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-217-balanced-numbers.english.md
@@ -24,7 +24,7 @@ Find T(47) mod 315
```yml
tests:
- text: euler217() should return 6273134.
- testString: assert.strictEqual(euler217(), 6273134, 'euler217() should return 6273134.');
+ testString: assert.strictEqual(euler217(), 6273134);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.english.md
index c75b5bd4aa..f0b51b3384 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.english.md
@@ -34,7 +34,7 @@ How many perfect right-angled triangles with c≤1016 exist that are not super-p
```yml
tests:
- text: euler218() should return 0.
- testString: assert.strictEqual(euler218(), 0, 'euler218() should return 0.');
+ testString: assert.strictEqual(euler218(), 0);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-219-skew-cost-coding.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-219-skew-cost-coding.english.md
index 4a399971bf..184ff71e9f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-219-skew-cost-coding.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-219-skew-cost-coding.english.md
@@ -32,7 +32,7 @@ What is Cost(109) ?
```yml
tests:
- text: euler219() should return 64564225042.
- testString: assert.strictEqual(euler219(), 64564225042, 'euler219() should return 64564225042.');
+ testString: assert.strictEqual(euler219(), 64564225042);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-22-names-scores.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-22-names-scores.english.md
index 648ad253df..bd67c8b4ab 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-22-names-scores.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-22-names-scores.english.md
@@ -22,11 +22,11 @@ What is the total of all the name scores in the file?
```yml
tests:
- text: namesScores(test1) should return 791.
- testString: assert.strictEqual(namesScores(test1), 791, 'namesScores(test1) should return 791.');
+ testString: assert.strictEqual(namesScores(test1), 791);
- text: namesScores(test2) should return 1468.
- testString: assert.strictEqual(namesScores(test2), 1468, 'namesScores(test2) should return 1468.');
+ testString: assert.strictEqual(namesScores(test2), 1468);
- text: namesScores(names) should return 871198282.
- testString: assert.strictEqual(namesScores(names), 871198282, 'namesScores(names) should return 871198282.');
+ testString: assert.strictEqual(namesScores(names), 871198282);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-220-heighway-dragon.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-220-heighway-dragon.english.md
index 36da67c496..4e8c5900f4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-220-heighway-dragon.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-220-heighway-dragon.english.md
@@ -35,7 +35,7 @@ Give your answer in the form x,y with no spaces.
```yml
tests:
- text: euler220() should return 139776, 963904.
- testString: assert.strictEqual(euler220(), 139776, 963904, 'euler220() should return 139776, 963904.');
+ testString: assert.strictEqual(euler220(), 139776, 963904);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-221-alexandrian-integers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-221-alexandrian-integers.english.md
index a9513f0aa7..897fb13fb5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-221-alexandrian-integers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-221-alexandrian-integers.english.md
@@ -28,7 +28,7 @@ Find the 150000th Alexandrian integer.
```yml
tests:
- text: euler221() should return 1884161251122450.
- testString: assert.strictEqual(euler221(), 1884161251122450, 'euler221() should return 1884161251122450.');
+ testString: assert.strictEqual(euler221(), 1884161251122450);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-222-sphere-packing.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-222-sphere-packing.english.md
index 9009113021..2da7554e51 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-222-sphere-packing.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-222-sphere-packing.english.md
@@ -22,7 +22,7 @@ Give your answer in micrometres (10-6 m) rounded to the nearest integer.
```yml
tests:
- text: euler222() should return 1590933.
- testString: assert.strictEqual(euler222(), 1590933, 'euler222() should return 1590933.');
+ testString: assert.strictEqual(euler222(), 1590933);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.english.md
index dad97e558a..0277e0d3ba 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.english.md
@@ -22,7 +22,7 @@ How many barely acute triangles are there with perimeter ≤ 25,000,000?
```yml
tests:
- text: euler223() should return 61614848.
- testString: assert.strictEqual(euler223(), 61614848, 'euler223() should return 61614848.');
+ testString: assert.strictEqual(euler223(), 61614848);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.english.md
index 25d2a0214b..ec47a2f0bc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.english.md
@@ -22,7 +22,7 @@ How many barely obtuse triangles are there with perimeter ≤ 75,000,000?
```yml
tests:
- text: euler224() should return 4137330.
- testString: assert.strictEqual(euler224(), 4137330, 'euler224() should return 4137330.');
+ testString: assert.strictEqual(euler224(), 4137330);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.english.md
index a418f63bfb..5659a853c3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.english.md
@@ -26,7 +26,7 @@ Find the 124th odd number that does not divide any terms of the above sequence.
```yml
tests:
- text: euler225() should return 2009.
- testString: assert.strictEqual(euler225(), 2009, 'euler225() should return 2009.');
+ testString: assert.strictEqual(euler225(), 2009);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.english.md
index fc717a9c22..642c259fef 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.english.md
@@ -29,7 +29,7 @@ What area under the blancmange curve is enclosed by C?Give your answer rounded t
```yml
tests:
- text: euler226() should return 0.11316017.
- testString: assert.strictEqual(euler226(), 0.11316017, 'euler226() should return 0.11316017.');
+ testString: assert.strictEqual(euler226(), 0.11316017);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-227-the-chase.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-227-the-chase.english.md
index a2b627d179..a78c49adc6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-227-the-chase.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-227-the-chase.english.md
@@ -27,7 +27,7 @@ Give your answer rounded to ten significant digits.
```yml
tests:
- text: euler227() should return 3780.618622.
- testString: assert.strictEqual(euler227(), 3780.618622, 'euler227() should return 3780.618622.');
+ testString: assert.strictEqual(euler227(), 3780.618622);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-228-minkowski-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-228-minkowski-sums.english.md
index 3fa386cdb0..67ed1026db 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-228-minkowski-sums.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-228-minkowski-sums.english.md
@@ -43,7 +43,7 @@ How many sides does S1864 + S1865 + … + S1909 have?
```yml
tests:
- text: euler228() should return 86226.
- testString: assert.strictEqual(euler228(), 86226, 'euler228() should return 86226.');
+ testString: assert.strictEqual(euler228(), 86226);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.english.md
index 3a16f25b34..c4f7d2a59a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.english.md
@@ -38,7 +38,7 @@ How many such numbers are there that do not exceed 2×109?
```yml
tests:
- text: euler229() should return 11325263.
- testString: assert.strictEqual(euler229(), 11325263, 'euler229() should return 11325263.');
+ testString: assert.strictEqual(euler229(), 11325263);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-23-non-abundant-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-23-non-abundant-sums.english.md
index 15cc7ad6a4..06af1cc72c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-23-non-abundant-sums.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-23-non-abundant-sums.english.md
@@ -23,13 +23,13 @@ Find the sum of all positive integers <= n which cannot be written as
```yml
tests:
- text: sumOfNonAbundantNumbers(10000) should return 3731004.
- testString: assert(sumOfNonAbundantNumbers(10000) === 3731004, 'sumOfNonAbundantNumbers(10000) should return 3731004.');
+ testString: assert(sumOfNonAbundantNumbers(10000) === 3731004);
- text: sumOfNonAbundantNumbers(15000) should return 4039939.
- testString: assert(sumOfNonAbundantNumbers(15000) === 4039939, 'sumOfNonAbundantNumbers(15000) should return 4039939.');
+ testString: assert(sumOfNonAbundantNumbers(15000) === 4039939);
- text: sumOfNonAbundantNumbers(20000) should return 4159710.
- testString: assert(sumOfNonAbundantNumbers(20000) === 4159710, 'sumOfNonAbundantNumbers(20000) should return 4159710.');
+ testString: assert(sumOfNonAbundantNumbers(20000) === 4159710);
- text: sumOfNonAbundantNumbers(28123) should return 4179871.
- testString: assert(sumOfNonAbundantNumbers(28123) === 4179871, 'sumOfNonAbundantNumbers(28123) should return 4179871.');
+ testString: assert(sumOfNonAbundantNumbers(28123) === 4179871);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-230-fibonacci-words.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-230-fibonacci-words.english.md
index 4c88668887..b283f858d4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-230-fibonacci-words.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-230-fibonacci-words.english.md
@@ -46,7 +46,7 @@ Find ∑n = 0,1,...,17 10n× DA,B((127+19n)×7n) .
```yml
tests:
- text: euler230() should return 850481152593119200.
- testString: assert.strictEqual(euler230(), 850481152593119200, 'euler230() should return 850481152593119200.');
+ testString: assert.strictEqual(euler230(), 850481152593119200);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.english.md
index c661abca60..0ab3da66cd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.english.md
@@ -24,7 +24,7 @@ Find the sum of the terms in the prime factorisation of 20000000C15000000.
```yml
tests:
- text: euler231() should return 7526965179680.
- testString: assert.strictEqual(euler231(), 7526965179680, 'euler231() should return 7526965179680.');
+ testString: assert.strictEqual(euler231(), 7526965179680);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-232-the-race.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-232-the-race.english.md
index 0c0f4401cf..9f90d8a2d7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-232-the-race.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-232-the-race.english.md
@@ -26,7 +26,7 @@ Give your answer rounded to eight decimal places in the form 0.abcdefgh .
```yml
tests:
- text: euler232() should return 0.83648556.
- testString: assert.strictEqual(euler232(), 0.83648556, 'euler232() should return 0.83648556.');
+ testString: assert.strictEqual(euler232(), 0.83648556);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.english.md
index 42f244aa7c..bb7c7334e7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.english.md
@@ -23,7 +23,7 @@ What is the sum of all positive integers N ≤ 1011 such that f(N) = 420
```yml
tests:
- text: euler233() should return 271204031455541300.
- testString: assert.strictEqual(euler233(), 271204031455541300, 'euler233() should return 271204031455541300.');
+ testString: assert.strictEqual(euler233(), 271204031455541300);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.english.md
index 82bca2a350..278907bd12 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.english.md
@@ -27,7 +27,7 @@ What is the sum of all semidivisible numbers not exceeding 999966663333 ?
```yml
tests:
- text: euler234() should return 1259187438574927000.
- testString: assert.strictEqual(euler234(), 1259187438574927000, 'euler234() should return 1259187438574927000.');
+ testString: assert.strictEqual(euler234(), 1259187438574927000);
```