From 5cf3b458fa039498c0bd7f3fdaceeb86f90fff83 Mon Sep 17 00:00:00 2001 From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> Date: Fri, 26 Jul 2019 19:48:23 -0700 Subject: [PATCH] fix: removed assert msg argument-7 (#36421) --- .../project-euler/problem-162-hexadecimal-numbers.english.md | 2 +- .../project-euler/problem-284-steady-squares.english.md | 2 +- .../problem-74-digit-factorial-chains.english.md | 2 +- .../problem-75-singular-integer-right-triangles.english.md | 2 +- .../project-euler/problem-76-counting-summations.english.md | 2 +- .../project-euler/problem-77-prime-summations.english.md | 2 +- .../project-euler/problem-78-coin-partitions.english.md | 2 +- .../project-euler/problem-79-passcode-derivation.english.md | 2 +- .../problem-8-largest-product-in-a-series.english.md | 4 ++-- .../problem-80-square-root-digital-expansion.english.md | 2 +- .../project-euler/problem-81-path-sum-two-ways.english.md | 2 +- .../project-euler/problem-82-path-sum-three-ways.english.md | 2 +- .../project-euler/problem-83-path-sum-four-ways.english.md | 2 +- .../project-euler/problem-84-monopoly-odds.english.md | 2 +- .../project-euler/problem-85-counting-rectangles.english.md | 2 +- .../project-euler/problem-86-cuboid-route.english.md | 2 +- .../project-euler/problem-87-prime-power-triples.english.md | 2 +- .../project-euler/problem-88-product-sum-numbers.english.md | 2 +- .../project-euler/problem-89-roman-numerals.english.md | 2 +- .../project-euler/problem-90-cube-digit-pairs.english.md | 2 +- ...lem-91-right-triangles-with-integer-coordinates.english.md | 2 +- .../project-euler/problem-92-square-digit-chains.english.md | 2 +- .../problem-93-arithmetic-expressions.english.md | 2 +- .../problem-94-almost-equilateral-triangles.english.md | 2 +- .../project-euler/problem-95-amicable-chains.english.md | 2 +- .../project-euler/problem-96-su-doku.english.md | 2 +- .../problem-97-large-non-mersenne-prime.english.md | 2 +- .../project-euler/problem-98-anagramic-squares.english.md | 2 +- .../project-euler/problem-99-largest-exponential.english.md | 2 +- 29 files changed, 30 insertions(+), 30 deletions(-) diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.english.md index f1525d5608..ccb3717edd 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.english.md @@ -27,7 +27,7 @@ Give your answer as a hexadecimal number. ```yml tests: - text: euler162() should return 3D58725572C62302. - testString: assert.strictEqual(euler162(), '3D58725572C62302', 'euler162() should return 3D58725572C62302.'); + testString: assert.strictEqual(euler162(), '3D58725572C62302'); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-284-steady-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-284-steady-squares.english.md index 2998ccddf7..3eb25694b3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-284-steady-squares.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-284-steady-squares.english.md @@ -27,7 +27,7 @@ Find the sum of the digits of all the n-digit steady squares in the base 14 numb ```yml tests: - text: euler284() should return 5a411d7b. - testString: assert.strictEqual(euler284(), '5a411d7b', 'euler284() should return 5a411d7b.'); + testString: assert.strictEqual(euler284(), '5a411d7b'); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.english.md index a40d3d5a00..1c3c44e96a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.english.md @@ -31,7 +31,7 @@ How many chains, with a starting number below one million, contain exactly sixty ```yml tests: - text: euler74() should return 402. - testString: assert.strictEqual(euler74(), 402, 'euler74() should return 402.'); + testString: assert.strictEqual(euler74(), 402); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.english.md index 53c2b77b4c..bb6f88a9df 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.english.md @@ -24,7 +24,7 @@ Given that L is the length of the wire, for how many values of L ≤ 1,500,000 c ```yml tests: - text: euler75() should return 161667. - testString: assert.strictEqual(euler75(), 161667, 'euler75() should return 161667.'); + testString: assert.strictEqual(euler75(), 161667); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-76-counting-summations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-76-counting-summations.english.md index c5c4c52e25..92c1139aa2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-76-counting-summations.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-76-counting-summations.english.md @@ -27,7 +27,7 @@ How many different ways can one hundred be written as a sum of at least two posi ```yml tests: - text: euler76() should return 190569291. - testString: assert.strictEqual(euler76(), 190569291, 'euler76() should return 190569291.'); + testString: assert.strictEqual(euler76(), 190569291); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-77-prime-summations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-77-prime-summations.english.md index ad9c75fabc..1b59de5d01 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-77-prime-summations.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-77-prime-summations.english.md @@ -26,7 +26,7 @@ What is the first value which can be written as the sum of primes in over five t ```yml tests: - text: euler77() should return 71. - testString: assert.strictEqual(euler77(), 71, 'euler77() should return 71.'); + testString: assert.strictEqual(euler77(), 71); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-78-coin-partitions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-78-coin-partitions.english.md index 3d6162de1f..2f2bfa5b5c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-78-coin-partitions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-78-coin-partitions.english.md @@ -30,7 +30,7 @@ Find the least value of n for which p(n) is divisible by one million. ```yml tests: - text: euler78() should return 55374. - testString: assert.strictEqual(euler78(), 55374, 'euler78() should return 55374.'); + testString: assert.strictEqual(euler78(), 55374); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-79-passcode-derivation.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-79-passcode-derivation.english.md index 4996004ed0..fcabc9e81e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-79-passcode-derivation.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-79-passcode-derivation.english.md @@ -22,7 +22,7 @@ Given that the three characters are always asked for in order, analyse the file ```yml tests: - text: euler79() should return 73162890. - testString: assert.strictEqual(euler79(), 73162890, 'euler79() should return 73162890.'); + testString: assert.strictEqual(euler79(), 73162890); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.english.md index 1ffd24dfd3..bd9390ac52 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.english.md @@ -42,9 +42,9 @@ Find the n adjacent digits in the 1000-digit number that have the g ```yml tests: - text: largestProductinaSeries(4) should return 5832. - testString: assert.strictEqual(largestProductinaSeries(4), 5832, 'largestProductinaSeries(4) should return 5832.'); + testString: assert.strictEqual(largestProductinaSeries(4), 5832); - text: largestProductinaSeries(13) should return 23514624000. - testString: assert.strictEqual(largestProductinaSeries(13), 23514624000, 'largestProductinaSeries(13) should return 23514624000.'); + testString: assert.strictEqual(largestProductinaSeries(13), 23514624000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.english.md index 000f6bb362..7982002e74 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.english.md @@ -22,7 +22,7 @@ For the first one hundred natural numbers, find the total of the digital sums of ```yml tests: - text: euler80() should return 40886. - testString: assert.strictEqual(euler80(), 40886, 'euler80() should return 40886.'); + testString: assert.strictEqual(euler80(), 40886); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.english.md index e3757c0ae6..5b7835bc5a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.english.md @@ -32,7 +32,7 @@ Find the minimal path sum, in matrix.txt (right click and "Save Link/Target As.. ```yml tests: - text: euler81() should return 427337. - testString: assert.strictEqual(euler81(), 427337, 'euler81() should return 427337.'); + testString: assert.strictEqual(euler81(), 427337); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.english.md index 0822e43d41..08b23a32fa 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.english.md @@ -33,7 +33,7 @@ Find the minimal path sum, in matrix.txt (right click and "Save Link/Target As.. ```yml tests: - text: euler82() should return 260324. - testString: assert.strictEqual(euler82(), 260324, 'euler82() should return 260324.'); + testString: assert.strictEqual(euler82(), 260324); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.english.md index 5421871caf..5c70423914 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.english.md @@ -34,7 +34,7 @@ Find the minimal path sum, in matrix.txt (right click and ```yml tests: - text: euler83() should return 425185. - testString: assert.strictEqual(euler83(), 425185, 'euler83() should return 425185.'); + testString: assert.strictEqual(euler83(), 425185); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-84-monopoly-odds.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-84-monopoly-odds.english.md index 4cf1b1bc88..405534ad5a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-84-monopoly-odds.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-84-monopoly-odds.english.md @@ -94,7 +94,7 @@ If, instead of using two 6-sided dice, two 4-sided dice are used, find the six-d ```yml tests: - text: euler84() should return 101524. - testString: assert.strictEqual(euler84(), 101524, 'euler84() should return 101524.'); + testString: assert.strictEqual(euler84(), 101524); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-85-counting-rectangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-85-counting-rectangles.english.md index 5b7d9fe163..9a51598643 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-85-counting-rectangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-85-counting-rectangles.english.md @@ -23,7 +23,7 @@ Although there exists no rectangular grid that contains exactly two million rect ```yml tests: - text: euler85() should return 2772. - testString: assert.strictEqual(euler85(), 2772, 'euler85() should return 2772.'); + testString: assert.strictEqual(euler85(), 2772); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-86-cuboid-route.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-86-cuboid-route.english.md index 801a8eb451..88e88dc453 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-86-cuboid-route.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-86-cuboid-route.english.md @@ -25,7 +25,7 @@ Find the least value of M such that the number of solutions first exceeds one mi ```yml tests: - text: euler86() should return 1818. - testString: assert.strictEqual(euler86(), 1818, 'euler86() should return 1818.'); + testString: assert.strictEqual(euler86(), 1818); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-87-prime-power-triples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-87-prime-power-triples.english.md index 6377db2d84..6d3c9aa13f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-87-prime-power-triples.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-87-prime-power-triples.english.md @@ -25,7 +25,7 @@ How many numbers below fifty million can be expressed as the sum of a prime squa ```yml tests: - text: euler87() should return 1097343. - testString: assert.strictEqual(euler87(), 1097343, 'euler87() should return 1097343.'); + testString: assert.strictEqual(euler87(), 1097343); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-88-product-sum-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-88-product-sum-numbers.english.md index 5da6604dc7..1e2593d547 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-88-product-sum-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-88-product-sum-numbers.english.md @@ -26,7 +26,7 @@ What is the sum of all the minimal product-sum numbers for 2≤k≤12000? ```yml tests: - text: euler88() should return 7587457. - testString: assert.strictEqual(euler88(), 7587457, 'euler88() should return 7587457.'); + testString: assert.strictEqual(euler88(), 7587457); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-89-roman-numerals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-89-roman-numerals.english.md index 3c361657af..44b2f32a6c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-89-roman-numerals.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-89-roman-numerals.english.md @@ -31,7 +31,7 @@ Note: You can assume that all the Roman numerals in the file contain no more tha ```yml tests: - text: euler89() should return 743. - testString: assert.strictEqual(euler89(), 743, 'euler89() should return 743.'); + testString: assert.strictEqual(euler89(), 743); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.english.md index 02e6f5b7e2..fbffbb60df 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.english.md @@ -40,7 +40,7 @@ How many distinct arrangements of the two cubes allow for all of the square numb ```yml tests: - text: euler90() should return 1217. - testString: assert.strictEqual(euler90(), 1217, 'euler90() should return 1217.'); + testString: assert.strictEqual(euler90(), 1217); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.english.md index 600b9572c3..e518f7badf 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.english.md @@ -30,7 +30,7 @@ Given that 0 ≤ x1, y1, x2, y2 ≤ 50, how many right triangles can be formed? ```yml tests: - text: euler91() should return 14234. - testString: assert.strictEqual(euler91(), 14234, 'euler91() should return 14234.'); + testString: assert.strictEqual(euler91(), 14234); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-92-square-digit-chains.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-92-square-digit-chains.english.md index 49e28090e3..579339a20f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-92-square-digit-chains.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-92-square-digit-chains.english.md @@ -25,7 +25,7 @@ How many starting numbers below ten million will arrive at 89? ```yml tests: - text: euler92() should return 8581146. - testString: assert.strictEqual(euler92(), 8581146, 'euler92() should return 8581146.'); + testString: assert.strictEqual(euler92(), 8581146); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.english.md index 1a3d00a590..d200a27464 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.english.md @@ -28,7 +28,7 @@ Find the set of four distinct digits, a < b < c < d, for which the longest set o ```yml tests: - text: euler93() should return 1258. - testString: assert.strictEqual(euler93(), 1258, 'euler93() should return 1258.'); + testString: assert.strictEqual(euler93(), 1258); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.english.md index b86cc4e520..d62a36fdd1 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.english.md @@ -22,7 +22,7 @@ Find the sum of the perimeters of all almost equilateral triangles with integral ```yml tests: - text: euler94() should return 518408346. - testString: assert.strictEqual(euler94(), 518408346, 'euler94() should return 518408346.'); + testString: assert.strictEqual(euler94(), 518408346); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-95-amicable-chains.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-95-amicable-chains.english.md index 5eab90ce22..784e7bd8b7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-95-amicable-chains.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-95-amicable-chains.english.md @@ -25,7 +25,7 @@ Find the smallest member of the longest amicable chain with no element exceeding ```yml tests: - text: euler95() should return 14316. - testString: assert.strictEqual(euler95(), 14316, 'euler95() should return 14316.'); + testString: assert.strictEqual(euler95(), 14316); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-96-su-doku.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-96-su-doku.english.md index 7c4b7746c4..ef18903f7c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-96-su-doku.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-96-su-doku.english.md @@ -48,7 +48,7 @@ By solving all fifty puzzles find the sum of the 3-digit numbers found in the to ```yml tests: - text: euler96() should return 24702. - testString: assert.strictEqual(euler96(), 24702, 'euler96() should return 24702.'); + testString: assert.strictEqual(euler96(), 24702); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.english.md index 6d095b8d7a..88212bc19f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.english.md @@ -22,7 +22,7 @@ Find the last ten digits of this prime number. ```yml tests: - text: euler97() should return 8739992577. - testString: assert.strictEqual(euler97(), 8739992577, 'euler97() should return 8739992577.'); + testString: assert.strictEqual(euler97(), 8739992577); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-98-anagramic-squares.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-98-anagramic-squares.english.md index 12546afc2d..4611dfd7b7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-98-anagramic-squares.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-98-anagramic-squares.english.md @@ -23,7 +23,7 @@ NOTE: All anagrams formed must be contained in the given text file. ```yml tests: - text: euler98() should return 18769. - testString: assert.strictEqual(euler98(), 18769, 'euler98() should return 18769.'); + testString: assert.strictEqual(euler98(), 18769); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-99-largest-exponential.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-99-largest-exponential.english.md index 6ffe1df369..d2672cc3d8 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-99-largest-exponential.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-99-largest-exponential.english.md @@ -23,7 +23,7 @@ NOTE: The first two lines in the file represent the numbers in the example given ```yml tests: - text: euler99() should return 709. - testString: assert.strictEqual(euler99(), 709, 'euler99() should return 709.'); + testString: assert.strictEqual(euler99(), 709); ```