From d73b94133a49be38ebd96f71ef84ee6fb954e83b Mon Sep 17 00:00:00 2001
From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>
Date: Thu, 25 Jul 2019 08:44:15 -0700
Subject: [PATCH] fix: removed assert msg argument (#36415)
---
.../problem-1-multiples-of-3-and-5.english.md | 8 ++++----
.../problem-10-summation-of-primes.english.md | 8 ++++----
.../problem-100-arranged-probability.english.md | 2 +-
.../problem-101-optimum-polynomial.english.md | 2 +-
.../problem-102-triangle-containment.english.md | 2 +-
.../problem-103-special-subset-sums-optimum.english.md | 2 +-
.../problem-104-pandigital-fibonacci-ends.english.md | 2 +-
.../problem-105-special-subset-sums-testing.english.md | 2 +-
...lem-106-special-subset-sums-meta-testing.english.md | 2 +-
.../problem-107-minimal-network.english.md | 2 +-
.../problem-108-diophantine-reciprocals-i.english.md | 2 +-
.../project-euler/problem-109-darts.english.md | 2 +-
.../problem-11-largest-product-in-a-grid.english.md | 4 ++--
.../problem-110-diophantine-reciprocals-ii.english.md | 4 ++--
.../problem-111-primes-with-runs.english.md | 2 +-
.../problem-112-bouncy-numbers.english.md | 2 +-
.../problem-113-non-bouncy-numbers.english.md | 2 +-
...roblem-114-counting-block-combinations-i.english.md | 2 +-
...oblem-115-counting-block-combinations-ii.english.md | 2 +-
.../problem-116-red-green-or-blue-tiles.english.md | 2 +-
.../problem-117-red-green-and-blue-tiles.english.md | 2 +-
.../problem-118-pandigital-prime-sets.english.md | 2 +-
.../problem-119-digit-power-sum.english.md | 2 +-
...em-12-highly-divisible-triangular-number.english.md | 10 +++++-----
.../problem-120-square-remainders.english.md | 2 +-
.../problem-121-disc-game-prize-fund.english.md | 2 +-
.../problem-122-efficient-exponentiation.english.md | 2 +-
.../problem-123-prime-square-remainders.english.md | 2 +-
.../problem-124-ordered-radicals.english.md | 2 +-
.../problem-125-palindromic-sums.english.md | 2 +-
.../project-euler/problem-126-cuboid-layers.english.md | 2 +-
.../project-euler/problem-127-abc-hits.english.md | 2 +-
.../problem-128-hexagonal-tile-differences.english.md | 2 +-
.../problem-129-repunit-divisibility.english.md | 2 +-
.../project-euler/problem-13-large-sum.english.md | 4 ++--
...0-composites-with-prime-repunit-property.english.md | 2 +-
.../problem-131-prime-cube-partnership.english.md | 2 +-
.../problem-132-large-repunit-factors.english.md | 2 +-
.../problem-133-repunit-nonfactors.english.md | 2 +-
.../problem-134-prime-pair-connection.english.md | 2 +-
.../problem-135-same-differences.english.md | 2 +-
.../problem-136-singleton-difference.english.md | 2 +-
.../problem-137-fibonacci-golden-nuggets.english.md | 2 +-
.../problem-138-special-isosceles-triangles.english.md | 2 +-
.../problem-139-pythagorean-tiles.english.md | 2 +-
.../problem-14-longest-collatz-sequence.english.md | 10 +++++-----
...em-140-modified-fibonacci-golden-nuggets.english.md | 2 +-
...gressive-numbers-n-which-are-also-square.english.md | 2 +-
.../problem-142-perfect-square-collection.english.md | 2 +-
...ating-the-torricelli-point-of-a-triangle.english.md | 2 +-
...ing-multiple-reflections-of-a-laser-beam.english.md | 2 +-
...ible-numbers-are-there-below-one-billion.english.md | 2 +-
...roblem-146-investigating-a-prime-pattern.english.md | 2 +-
...em-147-rectangles-in-cross-hatched-grids.english.md | 2 +-
.../problem-148-exploring-pascals-triangle.english.md | 2 +-
...-searching-for-a-maximum-sum-subsequence.english.md | 2 +-
.../project-euler/problem-15-lattice-paths.english.md | 6 +++---
...ay-for-a-sub-triangle-having-minimum-sum.english.md | 2 +-
...standard-sizes-an-expected-value-problem.english.md | 2 +-
...ing-one-half-as-a-sum-of-inverse-squares.english.md | 2 +-
...blem-153-investigating-gaussian-integers.english.md | 2 +-
.../problem-154-exploring-pascals-pyramid.english.md | 2 +-
.../problem-155-counting-capacitor-circuits.english.md | 2 +-
.../problem-156-counting-digits.english.md | 2 +-
...lem-157-solving-the-diophantine-equation.english.md | 2 +-
...phically-after-its-neighbour-to-the-left.english.md | 2 +-
...-159-digital-root-sums-of-factorisations.english.md | 2 +-
.../problem-16-power-digit-sum.english.md | 6 +++---
.../problem-160-factorial-trailing-digits.english.md | 2 +-
.../project-euler/problem-161-triominoes.english.md | 2 +-
.../problem-163-cross-hatched-triangles.english.md | 2 +-
...ts-have-a-sum-greater-than-a-given-value.english.md | 2 +-
.../project-euler/problem-165-intersections.english.md | 2 +-
.../project-euler/problem-166-criss-cross.english.md | 2 +-
...problem-167-investigating-ulam-sequences.english.md | 2 +-
75 files changed, 96 insertions(+), 96 deletions(-)
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.english.md
index 9cff7c0e62..e725b04df2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.english.md
@@ -21,13 +21,13 @@ Find the sum of all the multiples of 3 or 5 below the provided parameter value <
```yml
tests:
- text: multiplesOf3and5(1000) should return 233168.
- testString: assert.strictEqual(multiplesOf3and5(1000), 233168, 'multiplesOf3and5(1000) should return 233168.');
+ testString: assert.strictEqual(multiplesOf3and5(1000), 233168);
- text: multiplesOf3and5(49) should return 543.
- testString: assert.strictEqual(multiplesOf3and5(49), 543, 'multiplesOf3and5(49) should return 543.');
+ testString: assert.strictEqual(multiplesOf3and5(49), 543);
- text: multiplesOf3and5(19564) should return 89301183.
- testString: assert.strictEqual(multiplesOf3and5(19564), 89301183, 'multiplesOf3and5(19564) should return 89301183.');
+ testString: assert.strictEqual(multiplesOf3and5(19564), 89301183);
- text: Your function is not returning the correct result using our tests values.
- testString: assert.strictEqual(multiplesOf3and5(8456), 16687353, 'Your function is not returning the correct result using our tests values.');
+ testString: assert.strictEqual(multiplesOf3and5(8456), 16687353);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md
index 3b0bc83eb9..2d18c1f0b1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.english.md
@@ -21,13 +21,13 @@ Find the sum of all the primes below n.
```yml
tests:
- text: primeSummation(17) should return 41.
- testString: assert.strictEqual(primeSummation(17), 41, 'primeSummation(17) should return 41.');
+ testString: assert.strictEqual(primeSummation(17), 41);
- text: primeSummation(2001) should return 277050.
- testString: assert.strictEqual(primeSummation(2001), 277050, 'primeSummation(2001) should return 277050.');
+ testString: assert.strictEqual(primeSummation(2001), 277050);
- text: primeSummation(140759) should return 873608362.
- testString: assert.strictEqual(primeSummation(140759), 873608362, 'primeSummation(140759) should return 873608362.');
+ testString: assert.strictEqual(primeSummation(140759), 873608362);
- text: primeSummation(2000000) should return 142913828922.
- testString: assert.strictEqual(primeSummation(2000000), 142913828922, 'primeSummation(2000000) should return 142913828922.');
+ testString: assert.strictEqual(primeSummation(2000000), 142913828922);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-100-arranged-probability.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-100-arranged-probability.english.md
index a55f25c901..7f21535bec 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-100-arranged-probability.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-100-arranged-probability.english.md
@@ -22,7 +22,7 @@ By finding the first arrangement to contain over 1012 = 1,000,000,000,000 discs
```yml
tests:
- text: euler100() should return 756872327473.
- testString: assert.strictEqual(euler100(), 756872327473, 'euler100() should return 756872327473.');
+ testString: assert.strictEqual(euler100(), 756872327473);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-101-optimum-polynomial.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-101-optimum-polynomial.english.md
index ec0df1935c..7854d037ae 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-101-optimum-polynomial.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-101-optimum-polynomial.english.md
@@ -40,7 +40,7 @@ Find the sum of FITs for the BOPs.
```yml
tests:
- text: euler101() should return 37076114526.
- testString: assert.strictEqual(euler101(), 37076114526, 'euler101() should return 37076114526.');
+ testString: assert.strictEqual(euler101(), 37076114526);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-102-triangle-containment.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-102-triangle-containment.english.md
index ba2c440f79..e32a41c086 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-102-triangle-containment.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-102-triangle-containment.english.md
@@ -26,7 +26,7 @@ NOTE: The first two examples in the file represent the triangles in the example
```yml
tests:
- text: euler102() should return 228.
- testString: assert.strictEqual(euler102(), 228, 'euler102() should return 228.');
+ testString: assert.strictEqual(euler102(), 228);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.english.md
index 932b3e89b7..bf613000d7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.english.md
@@ -28,7 +28,7 @@ NOTE: This problem is related to Problem 105 and Problem 106.
```yml
tests:
- text: euler103() should return 20313839404245.
- testString: assert.strictEqual(euler103(), 20313839404245, 'euler103() should return 20313839404245.');
+ testString: assert.strictEqual(euler103(), 20313839404245);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.english.md
index 383a0201a0..4cd792aebc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.english.md
@@ -23,7 +23,7 @@ Given that Fk is the first Fibonacci number for which the first nine digits AND
```yml
tests:
- text: euler104() should return 329468.
- testString: assert.strictEqual(euler104(), 329468, 'euler104() should return 329468.');
+ testString: assert.strictEqual(euler104(), 329468);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.english.md
index 92b20f2bfb..b22409ee75 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.english.md
@@ -25,7 +25,7 @@ NOTE: This problem is related to Problem 103 and Problem 106.
```yml
tests:
- text: euler105() should return 73702.
- testString: assert.strictEqual(euler105(), 73702, 'euler105() should return 73702.');
+ testString: assert.strictEqual(euler105(), 73702);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.english.md
index 42afa3b165..ae342f726a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.english.md
@@ -26,7 +26,7 @@ NOTE: This problem is related to Problem 103 and Problem 105.
```yml
tests:
- text: euler106() should return 21384.
- testString: assert.strictEqual(euler106(), 21384, 'euler106() should return 21384.');
+ testString: assert.strictEqual(euler106(), 21384);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-107-minimal-network.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-107-minimal-network.english.md
index e9fca04f44..e258de185b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-107-minimal-network.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-107-minimal-network.english.md
@@ -35,7 +35,7 @@ Using network.txt (right click and 'Save Link/Target As...'), a 6K text file con
```yml
tests:
- text: euler107() should return 259679.
- testString: assert.strictEqual(euler107(), 259679, 'euler107() should return 259679.');
+ testString: assert.strictEqual(euler107(), 259679);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.english.md
index 47de15fd45..0d6d7a46ed 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.english.md
@@ -24,7 +24,7 @@ What is the least value of n for which the number of distinct solutio
```yml
tests:
- text: diophantineOne() should return 180180.
- testString: assert.strictEqual(diophantineOne(), 180180, 'diophantineOne() should return 180180.');
+ testString: assert.strictEqual(diophantineOne(), 180180);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-109-darts.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-109-darts.english.md
index b39993d0e6..d288d7f4be 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-109-darts.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-109-darts.english.md
@@ -66,7 +66,7 @@ How many distinct ways can a player checkout with a score less than 100?
```yml
tests:
- text: euler109() should return 38182.
- testString: assert.strictEqual(euler109(), 38182, 'euler109() should return 38182.');
+ testString: assert.strictEqual(euler109(), 38182);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.english.md
index ef018a0d3c..cd181bb814 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.english.md
@@ -44,9 +44,9 @@ What is the greatest product of four adjacent numbers in the same direction (up,
```yml
tests:
- text: largestGridProduct(grid) should return 70600674.
- testString: assert.strictEqual(largestGridProduct(grid), 70600674, 'largestGridProduct(grid) should return 70600674.');
+ testString: assert.strictEqual(largestGridProduct(grid), 70600674);
- text: largestGridProduct(testGrid) should return 14169081.
- testString: assert.strictEqual(largestGridProduct(testGrid), 14169081, 'largestGridProduct(testGrid) should return 14169081.');
+ testString: assert.strictEqual(largestGridProduct(testGrid), 14169081);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.english.md
index b10fd79678..8a3cab5d4f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.english.md
@@ -22,8 +22,8 @@ What is the least value of n for which the number of distinct solutio
```yml
tests:
- - text: diophantineTwo should return 9350130049860600.
- testString: assert.strictEqual(diophantineTwo(), 9350130049860600, 'diophantineTwo() should return 9350130049860600.');
+ - text: diophantineTwo() should return 9350130049860600.
+ testString: assert.strictEqual(diophantineTwo(), 9350130049860600);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-111-primes-with-runs.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-111-primes-with-runs.english.md
index f253526bb3..74a6869514 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-111-primes-with-runs.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-111-primes-with-runs.english.md
@@ -72,7 +72,7 @@ Find the sum of all S(10, d).
```yml
tests:
- text: euler111() should return 612407567715.
- testString: assert.strictEqual(euler111(), 612407567715, 'euler111() should return 612407567715.');
+ testString: assert.strictEqual(euler111(), 612407567715);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-112-bouncy-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-112-bouncy-numbers.english.md
index e0839851fb..0591df2ea3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-112-bouncy-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-112-bouncy-numbers.english.md
@@ -25,7 +25,7 @@ Find the least number for which the proportion of bouncy numbers is exactly 99%.
```yml
tests:
- text: euler112() should return 1587000.
- testString: assert.strictEqual(euler112(), 1587000, 'euler112() should return 1587000.');
+ testString: assert.strictEqual(euler112(), 1587000);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.english.md
index 2e3677aafb..87b644936c 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.english.md
@@ -24,7 +24,7 @@ How many numbers below a googol (10100) are not bouncy?
```yml
tests:
- text: euler113() should return 51161058134250.
- testString: assert.strictEqual(euler113(), 51161058134250, 'euler113() should return 51161058134250.');
+ testString: assert.strictEqual(euler113(), 51161058134250);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.english.md
index 257b715a0b..a952793625 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.english.md
@@ -123,7 +123,7 @@ NOTE: Although the example above does not lend itself to the possibility, in gen
```yml
tests:
- text: euler114() should return 16475640049.
- testString: assert.strictEqual(euler114(), 16475640049, 'euler114() should return 16475640049.');
+ testString: assert.strictEqual(euler114(), 16475640049);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.english.md
index 21aa0b19e4..5ada9287d6 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.english.md
@@ -26,7 +26,7 @@ For m = 50, find the least value of n for which the fill-count function first ex
```yml
tests:
- text: euler115() should return 168.
- testString: assert.strictEqual(euler115(), 168, 'euler115() should return 168.');
+ testString: assert.strictEqual(euler115(), 168);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.english.md
index 2e09591191..5516b258d4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.english.md
@@ -93,7 +93,7 @@ NOTE: This is related to Problem 117.
```yml
tests:
- text: euler116() should return 20492570929.
- testString: assert.strictEqual(euler116(), 20492570929, 'euler116() should return 20492570929.');
+ testString: assert.strictEqual(euler116(), 20492570929);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.english.md
index 94885712b8..ce7ab272b4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.english.md
@@ -101,7 +101,7 @@ NOTE: This is related to Problem 116.
```yml
tests:
- text: euler117() should return 100808458960497.
- testString: assert.strictEqual(euler117(), 100808458960497, 'euler117() should return 100808458960497.');
+ testString: assert.strictEqual(euler117(), 100808458960497);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md
index 19f9316ea2..d2ce9f343a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md
@@ -21,7 +21,7 @@ How many distinct sets containing each of the digits one through nine exactly on
```yml
tests:
- text: euler118() should return 44680.
- testString: assert.strictEqual(euler118(), 44680, 'euler118() should return 44680.');
+ testString: assert.strictEqual(euler118(), 44680);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-119-digit-power-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-119-digit-power-sum.english.md
index 04d73fc6a9..1393b04ec5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-119-digit-power-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-119-digit-power-sum.english.md
@@ -23,7 +23,7 @@ Find a30.
```yml
tests:
- text: euler119() should return 248155780267521.
- testString: assert.strictEqual(euler119(), 248155780267521, 'euler119() should return 248155780267521.');
+ testString: assert.strictEqual(euler119(), 248155780267521);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.english.md
index ff1ee5a780..8252cbf4a9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.english.md
@@ -31,15 +31,15 @@ What is the value of the first triangle number to have over n divis
```yml
tests:
- text: divisibleTriangleNumber(5) should return 28.
- testString: assert.strictEqual(divisibleTriangleNumber(5), 28, 'divisibleTriangleNumber(5) should return 28.');
+ testString: assert.strictEqual(divisibleTriangleNumber(5), 28);
- text: divisibleTriangleNumber(23) should return 630.
- testString: assert.strictEqual(divisibleTriangleNumber(23), 630, 'divisibleTriangleNumber(23) should return 630.');
+ testString: assert.strictEqual(divisibleTriangleNumber(23), 630);
- text: divisibleTriangleNumber(167) should return 1385280.
- testString: assert.strictEqual(divisibleTriangleNumber(167), 1385280, 'divisibleTriangleNumber(167) should return 1385280.');
+ testString: assert.strictEqual(divisibleTriangleNumber(167), 1385280);
- text: divisibleTriangleNumber(374) should return 17907120.
- testString: assert.strictEqual(divisibleTriangleNumber(374), 17907120, 'divisibleTriangleNumber(374) should return 17907120.');
+ testString: assert.strictEqual(divisibleTriangleNumber(374), 17907120);
- text: divisibleTriangleNumber(500) should return 76576500.
- testString: assert.strictEqual(divisibleTriangleNumber(500), 76576500, 'divisibleTriangleNumber(500) should return 76576500.');
+ testString: assert.strictEqual(divisibleTriangleNumber(500), 76576500);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-120-square-remainders.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-120-square-remainders.english.md
index b09deb07eb..2434de017f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-120-square-remainders.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-120-square-remainders.english.md
@@ -22,7 +22,7 @@ For 3 ≤ a ≤ 1000, find ∑ rmax.
```yml
tests:
- text: euler120() should return 333082500.
- testString: assert.strictEqual(euler120(), 333082500, 'euler120() should return 333082500.');
+ testString: assert.strictEqual(euler120(), 333082500);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.english.md
index 4c130eb4ee..a55f1cd613 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.english.md
@@ -23,7 +23,7 @@ Find the maximum prize fund that should be allocated to a single game in which f
```yml
tests:
- text: euler121() should return 2269.
- testString: assert.strictEqual(euler121(), 2269, 'euler121() should return 2269.');
+ testString: assert.strictEqual(euler121(), 2269);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.english.md
index 2a982b8d2b..b90066725e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.english.md
@@ -27,7 +27,7 @@ For 1 ≤ k ≤ 200, find ∑ m(k).
```yml
tests:
- text: euler122() should return 1582.
- testString: assert.strictEqual(euler122(), 1582, 'euler122() should return 1582.');
+ testString: assert.strictEqual(euler122(), 1582);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.english.md
index 9e3c470312..5cb09612f9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.english.md
@@ -23,7 +23,7 @@ Find the least value of n for which the remainder first exceeds 1010.
```yml
tests:
- text: euler123() should return 21035.
- testString: assert.strictEqual(euler123(), 21035, 'euler123() should return 21035.');
+ testString: assert.strictEqual(euler123(), 21035);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-124-ordered-radicals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-124-ordered-radicals.english.md
index 8dac935a54..e760696bc5 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-124-ordered-radicals.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-124-ordered-radicals.english.md
@@ -62,7 +62,7 @@ If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).
```yml
tests:
- text: euler124() should return 21417.
- testString: assert.strictEqual(euler124(), 21417, 'euler124() should return 21417.');
+ testString: assert.strictEqual(euler124(), 21417);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-125-palindromic-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-125-palindromic-sums.english.md
index 26be0bdba9..0c1b7daf04 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-125-palindromic-sums.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-125-palindromic-sums.english.md
@@ -22,7 +22,7 @@ Find the sum of all the numbers less than 108 that are both palindromic and can
```yml
tests:
- text: euler125() should return 2906969179.
- testString: assert.strictEqual(euler125(), 2906969179, 'euler125() should return 2906969179.');
+ testString: assert.strictEqual(euler125(), 2906969179);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-126-cuboid-layers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-126-cuboid-layers.english.md
index 284eb9e04a..f3a8ca536e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-126-cuboid-layers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-126-cuboid-layers.english.md
@@ -27,7 +27,7 @@ Find the least value of n for which C(n) = 1000.
```yml
tests:
- text: euler126() should return 18522.
- testString: assert.strictEqual(euler126(), 18522, 'euler126() should return 18522.');
+ testString: assert.strictEqual(euler126(), 18522);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-127-abc-hits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-127-abc-hits.english.md
index 777969e419..bfaee63fea 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-127-abc-hits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-127-abc-hits.english.md
@@ -32,7 +32,7 @@ Find ∑c for c < 120000.
```yml
tests:
- text: euler127() should return 18407904.
- testString: assert.strictEqual(euler127(), 18407904, 'euler127() should return 18407904.');
+ testString: assert.strictEqual(euler127(), 18407904);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.english.md
index 13e917ab76..acf58e292d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.english.md
@@ -29,7 +29,7 @@ Find the 2000th tile in this sequence.
```yml
tests:
- text: euler128() should return 14516824220.
- testString: assert.strictEqual(euler128(), 14516824220, 'euler128() should return 14516824220.');
+ testString: assert.strictEqual(euler128(), 14516824220);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-129-repunit-divisibility.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-129-repunit-divisibility.english.md
index 27c283e725..8d12a41e71 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-129-repunit-divisibility.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-129-repunit-divisibility.english.md
@@ -23,7 +23,7 @@ Find the least value of n for which A(n) first exceeds one-million.
```yml
tests:
- text: euler129() should return 1000023.
- testString: assert.strictEqual(euler129(), 1000023, 'euler129() should return 1000023.');
+ testString: assert.strictEqual(euler129(), 1000023);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-13-large-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-13-large-sum.english.md
index 1834b37932..656795d46b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-13-large-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-13-large-sum.english.md
@@ -121,9 +121,9 @@ Work out the first ten digits of the sum of the following one-hundred 50-digit n
```yml
tests:
- text: largeSum(testNums) should return 8348422521.
- testString: assert.strictEqual(largeSum(testNums), 8348422521, 'largeSum(testNums) should return 8348422521.');
+ testString: assert.strictEqual(largeSum(testNums), 8348422521);
- text: largeSum(fiftyDigitNums) should return 5537376230.
- testString: assert.strictEqual(largeSum(fiftyDigitNums), 5537376230, 'largeSum(fiftyDigitNums) should return 5537376230.');
+ testString: assert.strictEqual(largeSum(fiftyDigitNums), 5537376230);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.english.md
index ff26f6df6a..0c7bf9b7e9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.english.md
@@ -24,7 +24,7 @@ Find the sum of the first twenty-five composite values of n for whichGCD(n, 10)
```yml
tests:
- text: euler130() should return 149253.
- testString: assert.strictEqual(euler130(), 149253, 'euler130() should return 149253.');
+ testString: assert.strictEqual(euler130(), 149253);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.english.md
index 851fa3e456..6f0c5f6193 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.english.md
@@ -23,7 +23,7 @@ How many primes below one million have this remarkable property?
```yml
tests:
- text: euler131() should return 173.
- testString: assert.strictEqual(euler131(), 173, 'euler131() should return 173.');
+ testString: assert.strictEqual(euler131(), 173);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md
index f38f7e13c3..85b1b455e1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md
@@ -22,7 +22,7 @@ Find the sum of the first forty prime factors of R(109).
```yml
tests:
- text: euler132() should return 843296.
- testString: assert.strictEqual(euler132(), 843296, 'euler132() should return 843296.');
+ testString: assert.strictEqual(euler132(), 843296);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.english.md
index 1c7ac74672..710e661b86 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.english.md
@@ -23,7 +23,7 @@ Find the sum of all the primes below one-hundred thousand that will never be a f
```yml
tests:
- text: euler133() should return 453647705.
- testString: assert.strictEqual(euler133(), 453647705, 'euler133() should return 453647705.');
+ testString: assert.strictEqual(euler133(), 453647705);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-134-prime-pair-connection.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-134-prime-pair-connection.english.md
index 6319c6b302..3bbfb08ca8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-134-prime-pair-connection.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-134-prime-pair-connection.english.md
@@ -22,7 +22,7 @@ Find ∑ S for every pair of consecutive primes with 5 ≤ p1 ≤ 1000000.
```yml
tests:
- text: euler134() should return 18613426663617120.
- testString: assert.strictEqual(euler134(), 18613426663617120, 'euler134() should return 18613426663617120.');
+ testString: assert.strictEqual(euler134(), 18613426663617120);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-135-same-differences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-135-same-differences.english.md
index 4121c9c767..0b2e37bd20 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-135-same-differences.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-135-same-differences.english.md
@@ -23,7 +23,7 @@ How many values of n less than one million have exactly ten distinct solutions?
```yml
tests:
- text: euler135() should return 4989.
- testString: assert.strictEqual(euler135(), 4989, 'euler135() should return 4989.');
+ testString: assert.strictEqual(euler135(), 4989);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md
index f778f42693..557e8a6cee 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md
@@ -23,7 +23,7 @@ How many values of n less than fifty million have exactly one solution?
```yml
tests:
- text: euler136() should return 2544559.
- testString: assert.strictEqual(euler136(), 2544559, 'euler136() should return 2544559.');
+ testString: assert.strictEqual(euler136(), 2544559);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.english.md
index d79dea5918..cfc28f0c92 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.english.md
@@ -41,7 +41,7 @@ Find the 15th golden nugget.
```yml
tests:
- text: euler137() should return 1120149658760.
- testString: assert.strictEqual(euler137(), 1120149658760, 'euler137() should return 1120149658760.');
+ testString: assert.strictEqual(euler137(), 1120149658760);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.english.md
index ef8dc77302..e95287e5fc 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.english.md
@@ -25,7 +25,7 @@ Find ∑ L for the twelve smallest isosceles triangles for which h = b ± 1 and
```yml
tests:
- text: euler138() should return 1118049290473932.
- testString: assert.strictEqual(euler138(), 1118049290473932, 'euler138() should return 1118049290473932.');
+ testString: assert.strictEqual(euler138(), 1118049290473932);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.english.md
index 71ed49c07b..1705feae45 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.english.md
@@ -25,7 +25,7 @@ Given that the perimeter of the right triangle is less than one-hundred million,
```yml
tests:
- text: euler139() should return 10057761.
- testString: assert.strictEqual(euler139(), 10057761, 'euler139() should return 10057761.');
+ testString: assert.strictEqual(euler139(), 10057761);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.english.md
index 4e3916ebd7..2b776cdfcd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.english.md
@@ -27,15 +27,15 @@ NOTE: Once the chain starts the terms are allowed to go above one million.
```yml
tests:
- text: longestCollatzSequence(14) should return 9.
- testString: assert.strictEqual(longestCollatzSequence(14), 9, 'longestCollatzSequence(14) should return 9.');
+ testString: assert.strictEqual(longestCollatzSequence(14), 9);
- text: longestCollatzSequence(5847) should return 3711.
- testString: assert.strictEqual(longestCollatzSequence(5847), 3711, 'longestCollatzSequence(5847) should return 3711.');
+ testString: assert.strictEqual(longestCollatzSequence(5847), 3711);
- text: longestCollatzSequence(46500) should return 35655.
- testString: assert.strictEqual(longestCollatzSequence(46500), 35655, 'longestCollatzSequence(46500) should return 35655.');
+ testString: assert.strictEqual(longestCollatzSequence(46500), 35655);
- text: longestCollatzSequence(54512) should return 52527.
- testString: assert.strictEqual(longestCollatzSequence(54512), 52527, 'longestCollatzSequence(54512) should return 52527.');
+ testString: assert.strictEqual(longestCollatzSequence(54512), 52527);
- text: longestCollatzSequence(1000000) should return 837799.
- testString: assert.strictEqual(longestCollatzSequence(1000000), 837799, 'longestCollatzSequence(1000000) should return 837799.');
+ testString: assert.strictEqual(longestCollatzSequence(1000000), 837799);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.english.md
index 1e792fd45c..91ef8209b7 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.english.md
@@ -32,7 +32,7 @@ Find the sum of the first thirty golden nuggets.
```yml
tests:
- text: euler140() should return 5673835352990.
- testString: assert.strictEqual(euler140(), 5673835352990, 'euler140() should return 5673835352990.');
+ testString: assert.strictEqual(euler140(), 5673835352990);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.english.md
index 3b8eb25748..3b8ae72ce2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.english.md
@@ -24,7 +24,7 @@ Find the sum of all progressive perfect squares below one trillion (1012).
```yml
tests:
- text: euler141() should return 878454337159.
- testString: assert.strictEqual(euler141(), 878454337159, 'euler141() should return 878454337159.');
+ testString: assert.strictEqual(euler141(), 878454337159);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-142-perfect-square-collection.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-142-perfect-square-collection.english.md
index 1eee7d227f..d919cd28f3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-142-perfect-square-collection.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-142-perfect-square-collection.english.md
@@ -20,7 +20,7 @@ Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y
```yml
tests:
- text: euler142() should return 1006193.
- testString: assert.strictEqual(euler142(), 1006193, 'euler142() should return 1006193.');
+ testString: assert.strictEqual(euler142(), 1006193);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.english.md
index 342aadf6bb..fd292d04c1 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.english.md
@@ -25,7 +25,7 @@ Find the sum of all distinct values of p + q + r ≤ 120000 for Torricelli trian
```yml
tests:
- text: euler143() should return 30758397.
- testString: assert.strictEqual(euler143(), 30758397, 'euler143() should return 30758397.');
+ testString: assert.strictEqual(euler143(), 30758397);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.english.md
index a29ac79cd8..57147b1998 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.english.md
@@ -29,7 +29,7 @@ How many times does the beam hit the internal surface of the white cell before e
```yml
tests:
- text: euler144() should return 354.
- testString: assert.strictEqual(euler144(), 354, 'euler144() should return 354.');
+ testString: assert.strictEqual(euler144(), 354);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.english.md
index 5197306718..81e72f5eb2 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.english.md
@@ -24,7 +24,7 @@ How many reversible numbers are there below one-billion (109)?
```yml
tests:
- text: euler145() should return 608720.
- testString: assert.strictEqual(euler145(), 608720, 'euler145() should return 608720.');
+ testString: assert.strictEqual(euler145(), 608720);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md
index 9938428dc1..d0dca10805 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md
@@ -22,7 +22,7 @@ What is the sum of all such integers n below 150 million?
```yml
tests:
- text: euler146() should return 676333270.
- testString: assert.strictEqual(euler146(), 676333270, 'euler146() should return 676333270.');
+ testString: assert.strictEqual(euler146(), 676333270);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.english.md
index a446e43b1b..7449b4d986 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.english.md
@@ -31,7 +31,7 @@ How many different rectangles could be situated within 47x43 and smaller grids?
```yml
tests:
- text: euler147() should return 846910284.
- testString: assert.strictEqual(euler147(), 846910284, 'euler147() should return 846910284.');
+ testString: assert.strictEqual(euler147(), 846910284);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
index a0a5c47a98..f9ace0d21b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md
@@ -31,7 +31,7 @@ Find the number of entries which are not divisible by 7 in the first one billion
```yml
tests:
- text: euler148() should return 2129970655314432.
- testString: assert.strictEqual(euler148(), 2129970655314432, 'euler148() should return 2129970655314432.');
+ testString: assert.strictEqual(euler148(), 2129970655314432);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.english.md
index da600a676a..0313d629e4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.english.md
@@ -36,7 +36,7 @@ Finally, find the greatest sum of (any number of) adjacent entries in any direct
```yml
tests:
- text: euler149() should return 52852124.
- testString: assert.strictEqual(euler149(), 52852124, 'euler149() should return 52852124.');
+ testString: assert.strictEqual(euler149(), 52852124);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-15-lattice-paths.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-15-lattice-paths.english.md
index 5b4dbe2d6e..4b2677090d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-15-lattice-paths.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-15-lattice-paths.english.md
@@ -24,11 +24,11 @@ How many such routes are there through a given gridSize?
```yml
tests:
- text: latticePaths(4) should return 70.
- testString: assert.strictEqual(latticePaths(4), 70, 'latticePaths(4) should return 70.');
+ testString: assert.strictEqual(latticePaths(4), 70);
- text: latticePaths(9) should return 48620.
- testString: assert.strictEqual(latticePaths(9), 48620, 'latticePaths(9) should return 48620.');
+ testString: assert.strictEqual(latticePaths(9), 48620);
- text: latticePaths(20) should return 137846528820.
- testString: assert.strictEqual(latticePaths(20), 137846528820, 'latticePaths(20) should return 137846528820.');
+ testString: assert.strictEqual(latticePaths(20), 137846528820);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.english.md
index 288b455547..a190c524c0 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.english.md
@@ -45,7 +45,7 @@ Find the smallest possible sub-triangle sum.
```yml
tests:
- text: euler150() should return -271248680.
- testString: assert.strictEqual(euler150(), -271248680, 'euler150() should return -271248680.');
+ testString: assert.strictEqual(euler150(), -271248680);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.english.md
index 5e9eb85360..4c80091600 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.english.md
@@ -27,7 +27,7 @@ Give your answer rounded to six decimal places using the format x.xxxxxx .
```yml
tests:
- text: euler151() should return 0.464399.
- testString: assert.strictEqual(euler151(), 0.464399, 'euler151() should return 0.464399.');
+ testString: assert.strictEqual(euler151(), 0.464399);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.english.md
index 69f227f66b..6a41485bb9 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.english.md
@@ -24,7 +24,7 @@ How many ways are there to write the number 1/2 as a sum of inverse squares usin
```yml
tests:
- text: euler152() should return 301.
- testString: assert.strictEqual(euler152(), 301, 'euler152() should return 301.');
+ testString: assert.strictEqual(euler152(), 301);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.english.md
index 5f49f55f9b..227fd0ce3e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.english.md
@@ -64,7 +64,7 @@ What is ∑ s(n) for 1 ≤ n ≤ 108?
```yml
tests:
- text: euler153() should return 17971254122360636.
- testString: assert.strictEqual(euler153(), 17971254122360636, 'euler153() should return 17971254122360636.');
+ testString: assert.strictEqual(euler153(), 17971254122360636);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.english.md
index b47c900bdb..4b0447694f 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.english.md
@@ -27,7 +27,7 @@ How many coefficients in the expansion of (x + y + z)200000 are multiples of 101
```yml
tests:
- text: euler154() should return 479742450.
- testString: assert.strictEqual(euler154(), 479742450, 'euler154() should return 479742450.');
+ testString: assert.strictEqual(euler154(), 479742450);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.english.md
index 9499875bc2..ab6549cf92 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.english.md
@@ -29,7 +29,7 @@ whereas when connecting them in series, the overall capacitance is given by:
```yml
tests:
- text: euler155() should return 3857447.
- testString: assert.strictEqual(euler155(), 3857447, 'euler155() should return 3857447.');
+ testString: assert.strictEqual(euler155(), 3857447);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-156-counting-digits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-156-counting-digits.english.md
index adf38298f5..1f031c6257 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-156-counting-digits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-156-counting-digits.english.md
@@ -52,7 +52,7 @@ Note: if, for some n, f(n,d)=n
```yml
tests:
- text: euler156() should return 21295121502550.
- testString: assert.strictEqual(euler156(), 21295121502550, 'euler156() should return 21295121502550.');
+ testString: assert.strictEqual(euler156(), 21295121502550);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.english.md
index 40264f53d9..8ad64e13c3 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.english.md
@@ -42,7 +42,7 @@ How many solutions has this equation for 1 ≤ n ≤ 9?
```yml
tests:
- text: euler157() should return 53490.
- testString: assert.strictEqual(euler157(), 53490, 'euler157() should return 53490.');
+ testString: assert.strictEqual(euler157(), 53490);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.english.md
index 63e33e2c6f..08d0671e32 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.english.md
@@ -27,7 +27,7 @@ What is the maximum value of p(n)?
```yml
tests:
- text: euler158() should return 409511334375.
- testString: assert.strictEqual(euler158(), 409511334375, 'euler158() should return 409511334375.');
+ testString: assert.strictEqual(euler158(), 409511334375);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.english.md
index 9488e93240..1f6ca145b8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.english.md
@@ -45,7 +45,7 @@ Find ∑mdrs(n) for 1 < n < 1,000,000.
```yml
tests:
- text: euler159() should return 14489159.
- testString: assert.strictEqual(euler159(), 14489159, 'euler159() should return 14489159.');
+ testString: assert.strictEqual(euler159(), 14489159);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-16-power-digit-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-16-power-digit-sum.english.md
index 8ed7a0d48a..fb06ad7509 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-16-power-digit-sum.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-16-power-digit-sum.english.md
@@ -21,11 +21,11 @@ What is the sum of the digits of the number 2exponent?
```yml
tests:
- text: powerDigitSum(15) should return 26.
- testString: assert.strictEqual(powerDigitSum(15), 26, 'powerDigitSum(15) should return 26.');
+ testString: assert.strictEqual(powerDigitSum(15), 26);
- text: powerDigitSum(128) should return 166.
- testString: assert.strictEqual(powerDigitSum(128), 166, 'powerDigitSum(128) should return 166.');
+ testString: assert.strictEqual(powerDigitSum(128), 166);
- text: powerDigitSum(1000) should return 1366.
- testString: assert.strictEqual(powerDigitSum(1000), 1366, 'powerDigitSum(1000) should return 1366.');
+ testString: assert.strictEqual(powerDigitSum(1000), 1366);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md
index 05d2bc4bfc..b10c6fec1a 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md
@@ -25,7 +25,7 @@ Find f(1,000,000,000,000)
```yml
tests:
- text: euler160() should return 16576.
- testString: assert.strictEqual(euler160(), 16576, 'euler160() should return 16576.');
+ testString: assert.strictEqual(euler160(), 16576);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md
index 6c84cc8eca..bbdb6e3609 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md
@@ -34,7 +34,7 @@ In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
```yml
tests:
- text: euler161() should return 20574308184277972.
- testString: assert.strictEqual(euler161(), 20574308184277972, 'euler161() should return 20574308184277972.');
+ testString: assert.strictEqual(euler161(), 20574308184277972);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.english.md
index d7ee700530..b86edbab39 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.english.md
@@ -27,7 +27,7 @@ Find T(36).
```yml
tests:
- text: euler163() should return 343047.
- testString: assert.strictEqual(euler163(), 343047, 'euler163() should return 343047.');
+ testString: assert.strictEqual(euler163(), 343047);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.english.md
index 32042482b4..37980d2dc4 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.english.md
@@ -20,7 +20,7 @@ How many 20 digit numbers n (without any leading zero) exist such that no three
```yml
tests:
- text: euler164() should return 378158756814587.
- testString: assert.strictEqual(euler164(), 378158756814587, 'euler164() should return 378158756814587.');
+ testString: assert.strictEqual(euler164(), 378158756814587);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-165-intersections.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-165-intersections.english.md
index d7f543b07e..187874121b 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-165-intersections.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-165-intersections.english.md
@@ -37,7 +37,7 @@ How many distinct true intersection points are found among the 5000 line segment
```yml
tests:
- text: euler165() should return 2868868.
- testString: assert.strictEqual(euler165(), 2868868, 'euler165() should return 2868868.');
+ testString: assert.strictEqual(euler165(), 2868868);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-166-criss-cross.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-166-criss-cross.english.md
index 8e793e95fd..9ab0b7cf14 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-166-criss-cross.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-166-criss-cross.english.md
@@ -32,7 +32,7 @@ In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so tha
```yml
tests:
- text: euler166() should return 7130034.
- testString: assert.strictEqual(euler166(), 7130034, 'euler166() should return 7130034.');
+ testString: assert.strictEqual(euler166(), 7130034);
```
diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.english.md
index bde8d235a1..e84138667e 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.english.md
@@ -25,7 +25,7 @@ Find ∑U(2,2n+1)k for 2 ≤ n ≤10, where k = 1011.
```yml
tests:
- text: euler167() should return 3916160068885.
- testString: assert.strictEqual(euler167(), 3916160068885, 'euler167() should return 3916160068885.');
+ testString: assert.strictEqual(euler167(), 3916160068885);
```