diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-371-licence-plates.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-371-licence-plates.english.md index 1d73bef81d..895c3e1746 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-371-licence-plates.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-371-licence-plates.english.md @@ -32,7 +32,7 @@ Note: We assume that each licence plate seen is equally likely to have any three ```yml tests: - text: euler371() should return 40.66368097. - testString: assert.strictEqual(euler371(), 40.66368097, 'euler371() should return 40.66368097.'); + testString: assert.strictEqual(euler371(), 40.66368097); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-372-pencils-of-rays.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-372-pencils-of-rays.english.md index e64ebb000a..60feaf3a8f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-372-pencils-of-rays.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-372-pencils-of-rays.english.md @@ -26,7 +26,7 @@ Note: represents the floor function. ```yml tests: - text: euler372() should return 301450082318807040. - testString: assert.strictEqual(euler372(), 301450082318807040, 'euler372() should return 301450082318807040.'); + testString: assert.strictEqual(euler372(), 301450082318807040); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-373-circumscribed-circles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-373-circumscribed-circles.english.md index 922883a7ce..a62e0d0124 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-373-circumscribed-circles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-373-circumscribed-circles.english.md @@ -29,7 +29,7 @@ Find S(107). ```yml tests: - text: euler373() should return 727227472448913. - testString: assert.strictEqual(euler373(), 727227472448913, 'euler373() should return 727227472448913.'); + testString: assert.strictEqual(euler373(), 727227472448913); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.english.md index ed8ceff555..b90570bcee 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.english.md @@ -39,7 +39,7 @@ Give your answer modulo 982451653, the 50 millionth prime. ```yml tests: - text: euler374() should return 334420941. - testString: assert.strictEqual(euler374(), 334420941, 'euler374() should return 334420941.'); + testString: assert.strictEqual(euler374(), 334420941); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.english.md index 4e4a9a690a..d860dfe280 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.english.md @@ -35,7 +35,7 @@ Find M(2 000 000 000). ```yml tests: - text: euler375() should return 7435327983715286000. - testString: assert.strictEqual(euler375(), 7435327983715286000, 'euler375() should return 7435327983715286000.'); + testString: assert.strictEqual(euler375(), 7435327983715286000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.english.md index 60221a5bb3..a7b0bcb848 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.english.md @@ -56,7 +56,7 @@ How many are there for N = 30 ? ```yml tests: - text: euler376() should return 973059630185670. - testString: assert.strictEqual(euler376(), 973059630185670, 'euler376() should return 973059630185670.'); + testString: assert.strictEqual(euler376(), 973059630185670); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.english.md index 20199968e7..c165d365dd 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.english.md @@ -29,7 +29,7 @@ Give the last 9 digits as your answer. ```yml tests: - text: euler377() should return 732385277. - testString: assert.strictEqual(euler377(), 732385277, 'euler377() should return 732385277.'); + testString: assert.strictEqual(euler377(), 732385277); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-378-triangle-triples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-378-triangle-triples.english.md index 09be9587e9..0006a1d857 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-378-triangle-triples.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-378-triangle-triples.english.md @@ -38,7 +38,7 @@ Give the last 18 digits of your answer. ```yml tests: - text: euler378() should return 147534623725724700. - testString: assert.strictEqual(euler378(), 147534623725724700, 'euler378() should return 147534623725724700.'); + testString: assert.strictEqual(euler378(), 147534623725724700); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.english.md index 76794b467f..56ce4becf4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.english.md @@ -30,7 +30,7 @@ Find g(1012). ```yml tests: - text: euler379() should return 132314136838185. - testString: assert.strictEqual(euler379(), 132314136838185, 'euler379() should return 132314136838185.'); + testString: assert.strictEqual(euler379(), 132314136838185); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-38-pandigital-multiples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-38-pandigital-multiples.english.md index 6ff66b5f06..3722407b8c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-38-pandigital-multiples.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-38-pandigital-multiples.english.md @@ -26,7 +26,7 @@ What is the largest 1 to 9 pandigital 9-digit number that can be formed as the c ```yml tests: - text: pandigitalMultiples() should return 932718654. - testString: assert.strictEqual(pandigitalMultiples(), 932718654, 'pandigitalMultiples() should return 932718654.'); + testString: assert.strictEqual(pandigitalMultiples(), 932718654); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-380-amazing-mazes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-380-amazing-mazes.english.md index a4ff3e8e38..01eb4e7c3e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-380-amazing-mazes.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-380-amazing-mazes.english.md @@ -33,7 +33,7 @@ E.g. if the answer is 1234567891011 then the answer format would be 1.2346e12. ```yml tests: - text: euler380() should return Infinity. - testString: assert.strictEqual(euler380(), Infinity, 'euler380() should return Infinity.'); + testString: assert.strictEqual(euler380(), Infinity); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-381-prime-k-factorial.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-381-prime-k-factorial.english.md index d669b657fd..ea1dc95e30 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-381-prime-k-factorial.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-381-prime-k-factorial.english.md @@ -31,7 +31,7 @@ Find ∑S(p) for 5 ≤ p < 108. ```yml tests: - text: euler381() should return 139602943319822. - testString: assert.strictEqual(euler381(), 139602943319822, 'euler381() should return 139602943319822.'); + testString: assert.strictEqual(euler381(), 139602943319822); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-382-generating-polygons.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-382-generating-polygons.english.md index b9a2f06e84..fb96026fa9 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-382-generating-polygons.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-382-generating-polygons.english.md @@ -43,7 +43,7 @@ Find the last 9 digits of f(1018). ```yml tests: - text: euler382() should return 697003956. - testString: assert.strictEqual(euler382(), 697003956, 'euler382() should return 697003956.'); + testString: assert.strictEqual(euler382(), 697003956); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.english.md index 983045913c..8e07151e0a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.english.md @@ -30,7 +30,7 @@ Find T5(1018). ```yml tests: - text: euler383() should return 22173624649806. - testString: assert.strictEqual(euler383(), 22173624649806, 'euler383() should return 22173624649806.'); + testString: assert.strictEqual(euler383(), 22173624649806); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.english.md index cdc037a855..9577a72a8d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.english.md @@ -44,7 +44,7 @@ Find ΣGF(t) for 2≤t≤45. ```yml tests: - text: euler384() should return 3354706415856333000. - testString: assert.strictEqual(euler384(), 3354706415856333000, 'euler384() should return 3354706415856333000.'); + testString: assert.strictEqual(euler384(), 3354706415856333000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.english.md index 4d4630a7e4..b655f3c9d5 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.english.md @@ -43,7 +43,7 @@ Find A(1 000 000 000). ```yml tests: - text: euler385() should return 3776957309612154000. - testString: assert.strictEqual(euler385(), 3776957309612154000, 'euler385() should return 3776957309612154000.'); + testString: assert.strictEqual(euler385(), 3776957309612154000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.english.md index d293a530e9..0577547131 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.english.md @@ -30,7 +30,7 @@ Find ΣN(n) for 1 ≤ n ≤ 108 ```yml tests: - text: euler386() should return 528755790. - testString: assert.strictEqual(euler386(), 528755790, 'euler386() should return 528755790.'); + testString: assert.strictEqual(euler386(), 528755790); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-387-harshad-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-387-harshad-numbers.english.md index 1ebefb8700..2c3919bd59 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-387-harshad-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-387-harshad-numbers.english.md @@ -36,7 +36,7 @@ Find the sum of the strong, right truncatable Harshad primes less than 1014. ```yml tests: - text: euler387() should return 696067597313468. - testString: assert.strictEqual(euler387(), 696067597313468, 'euler387() should return 696067597313468.'); + testString: assert.strictEqual(euler387(), 696067597313468); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-388-distinct-lines.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-388-distinct-lines.english.md index d1f59b49f6..8ff1f23e9a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-388-distinct-lines.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-388-distinct-lines.english.md @@ -29,7 +29,7 @@ Find D(1010). Give as your answer the first nine digits followed by the last nin ```yml tests: - text: euler388() should return 831907372805130000. - testString: assert.strictEqual(euler388(), 831907372805130000, 'euler388() should return 831907372805130000.'); + testString: assert.strictEqual(euler388(), 831907372805130000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-389-platonic-dice.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-389-platonic-dice.english.md index c6a4fd5060..2336833e66 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-389-platonic-dice.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-389-platonic-dice.english.md @@ -21,7 +21,7 @@ Find the variance of I, and give your answer rounded to 4 decimal places. ```yml tests: - text: euler389() should return 2406376.3623. - testString: assert.strictEqual(euler389(), 2406376.3623, 'euler389() should return 2406376.3623.'); + testString: assert.strictEqual(euler389(), 2406376.3623); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-39-integer-right-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-39-integer-right-triangles.english.md index 4f03e4456b..6c2dcd892c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-39-integer-right-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-39-integer-right-triangles.english.md @@ -22,13 +22,13 @@ For which value of p ≤ n, is the number of solutions maximised? ```yml tests: - text: intRightTriangles(500) should return 420. - testString: assert(intRightTriangles(500) == 420, 'intRightTriangles(500) should return 420.'); + testString: assert(intRightTriangles(500) == 420); - text: intRightTriangles(800) should return 420. - testString: assert(intRightTriangles(800) == 420, 'intRightTriangles(800) should return 420.'); + testString: assert(intRightTriangles(800) == 420); - text: intRightTriangles(900) should return 840. - testString: assert(intRightTriangles(900) == 840, 'intRightTriangles(900) should return 840.'); + testString: assert(intRightTriangles(900) == 840); - text: intRightTriangles(1000) should return 840. - testString: assert(intRightTriangles(1000) == 840, 'intRightTriangles(1000) should return 840.'); + testString: assert(intRightTriangles(1000) == 840); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.english.md index 3219a16aef..668d9e312f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.english.md @@ -29,7 +29,7 @@ Find S(1010). ```yml tests: - text: euler390() should return 2919133642971. - testString: assert.strictEqual(euler390(), 2919133642971, 'euler390() should return 2919133642971.'); + testString: assert.strictEqual(euler390(), 2919133642971); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-391-hopping-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-391-hopping-game.english.md index a5448bc1ad..1da280c002 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-391-hopping-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-391-hopping-game.english.md @@ -47,7 +47,7 @@ Find Σ(M(n))3 for 1 ≤ n ≤ 1000. ```yml tests: - text: euler391() should return 61029882288. - testString: assert.strictEqual(euler391(), 61029882288, 'euler391() should return 61029882288.'); + testString: assert.strictEqual(euler391(), 61029882288); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.english.md index 139e6bcce2..217cb67b2d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.english.md @@ -36,7 +36,7 @@ Give as your answer the area occupied by the red cells rounded to 10 digits behi ```yml tests: - text: euler392() should return 3.1486734435. - testString: assert.strictEqual(euler392(), 3.1486734435, 'euler392() should return 3.1486734435.'); + testString: assert.strictEqual(euler392(), 3.1486734435); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-393-migrating-ants.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-393-migrating-ants.english.md index a39cd29663..4bcadbc658 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-393-migrating-ants.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-393-migrating-ants.english.md @@ -26,7 +26,7 @@ Find f(10). ```yml tests: - text: euler393() should return 112398351350823100. - testString: assert.strictEqual(euler393(), 112398351350823100, 'euler393() should return 112398351350823100.'); + testString: assert.strictEqual(euler393(), 112398351350823100); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-394-eating-pie.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-394-eating-pie.english.md index 0d6e142899..67935ba0aa 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-394-eating-pie.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-394-eating-pie.english.md @@ -36,7 +36,7 @@ Find E(40) rounded to 10 decimal places behind the decimal point. ```yml tests: - text: euler394() should return 3.2370342194. - testString: assert.strictEqual(euler394(), 3.2370342194, 'euler394() should return 3.2370342194.'); + testString: assert.strictEqual(euler394(), 3.2370342194); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-395-pythagorean-tree.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-395-pythagorean-tree.english.md index 92c5ab89db..11d58da05f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-395-pythagorean-tree.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-395-pythagorean-tree.english.md @@ -38,7 +38,7 @@ Find the smallest area possible for such a bounding rectangle, and give your ans ```yml tests: - text: euler395() should return 28.2453753155. - testString: assert.strictEqual(euler395(), 28.2453753155, 'euler395() should return 28.2453753155.'); + testString: assert.strictEqual(euler395(), 28.2453753155); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.english.md index 9f0fb138ef..72208a3bef 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.english.md @@ -44,7 +44,7 @@ Find the last 9 digits of ΣG(n) for 1 ≤ n < 16. ```yml tests: - text: euler396() should return 173214653. - testString: assert.strictEqual(euler396(), 173214653, 'euler396() should return 173214653.'); + testString: assert.strictEqual(euler396(), 173214653); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.english.md index 0d7b581b42..61b6b9d00b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.english.md @@ -27,7 +27,7 @@ Find F(106, 109). ```yml tests: - text: euler397() should return 141630459461893730. - testString: assert.strictEqual(euler397(), 141630459461893730, 'euler397() should return 141630459461893730.'); + testString: assert.strictEqual(euler397(), 141630459461893730); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-398-cutting-rope.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-398-cutting-rope.english.md index 2fc5ff881a..c676b9018f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-398-cutting-rope.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-398-cutting-rope.english.md @@ -29,7 +29,7 @@ Give your answer rounded to 5 decimal places behind the decimal point. ```yml tests: - text: euler398() should return 2010.59096. - testString: assert.strictEqual(euler398(), 2010.59096, 'euler398() should return 2010.59096.'); + testString: assert.strictEqual(euler398(), 2010.59096); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.english.md index 62296ff9b2..bc8aea3155 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.english.md @@ -41,7 +41,7 @@ If it happens that the conjecture is false, then the accepted answer to this pro ```yml tests: - text: euler399() should return 1508395636674243, 6.5e27330467. - testString: assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467, 'euler399() should return 1508395636674243, 6.5e27330467.'); + testString: assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.english.md index 6f339040a2..f25017effe 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.english.md @@ -21,9 +21,9 @@ Find the largest palindrome made from the product of two n-digit nu ```yml tests: - text: largestPalindromeProduct(2) should return 9009. - testString: assert.strictEqual(largestPalindromeProduct(2), 9009, 'largestPalindromeProduct(2) should return 9009.'); + testString: assert.strictEqual(largestPalindromeProduct(2), 9009); - text: largestPalindromeProduct(3) should return 906609. - testString: assert.strictEqual(largestPalindromeProduct(3), 906609, 'largestPalindromeProduct(3) should return 906609.'); + testString: assert.strictEqual(largestPalindromeProduct(3), 906609); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-40-champernownes-constant.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-40-champernownes-constant.english.md index 9dae37dbaf..46eee55f0b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-40-champernownes-constant.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-40-champernownes-constant.english.md @@ -24,11 +24,11 @@ If dn represents the nth digit of the fracti ```yml tests: - text: champernownesConstant(100) should return 5. - testString: assert.strictEqual(champernownesConstant(100), 5, 'champernownesConstant(100) should return 5.'); + testString: assert.strictEqual(champernownesConstant(100), 5); - text: champernownesConstant(1000) should return 15. - testString: assert.strictEqual(champernownesConstant(1000), 15, 'champernownesConstant(1000) should return 15.'); + testString: assert.strictEqual(champernownesConstant(1000), 15); - text: champernownesConstant(1000000) should return 210. - testString: assert.strictEqual(champernownesConstant(1000000), 210, 'champernownesConstant(1000000) should return 210.'); + testString: assert.strictEqual(champernownesConstant(1000000), 210); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.english.md index c00ce78c98..b587c0f3d3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.english.md @@ -41,7 +41,7 @@ Find f(10000). Give the last 18 digits of your answer. ```yml tests: - text: euler400() should return 438505383468410600. - testString: assert.strictEqual(euler400(), 438505383468410600, 'euler400() should return 438505383468410600.'); + testString: assert.strictEqual(euler400(), 438505383468410600); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.english.md index ca15089db2..ab411dce3e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.english.md @@ -31,7 +31,7 @@ Find SIGMA2(1015) modulo 109. ```yml tests: - text: euler401() should return 281632621. - testString: assert.strictEqual(euler401(), 281632621, 'euler401() should return 281632621.'); + testString: assert.strictEqual(euler401(), 281632621); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.english.md index a96c519845..ac2c98cd4b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.english.md @@ -37,7 +37,7 @@ Find the last 9 digits of Σ S(Fk) for 2 ≤ k ≤ 1234567890123. ```yml tests: - text: euler402() should return 356019862. - testString: assert.strictEqual(euler402(), 356019862, 'euler402() should return 356019862.'); + testString: assert.strictEqual(euler402(), 356019862); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.english.md index 694a599351..53019ed8a0 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.english.md @@ -31,7 +31,7 @@ Find S(1012). Give your answer mod 108. ```yml tests: - text: euler403() should return 18224771. - testString: assert.strictEqual(euler403(), 18224771, 'euler403() should return 18224771.'); + testString: assert.strictEqual(euler403(), 18224771); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.english.md index 949815cf63..2d6eadc0c2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.english.md @@ -39,7 +39,7 @@ Find C(1017). ```yml tests: - text: euler404() should return 1199215615081353. - testString: assert.strictEqual(euler404(), 1199215615081353, 'euler404() should return 1199215615081353.'); + testString: assert.strictEqual(euler404(), 1199215615081353); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.english.md index 675ab994a0..0ff2bf10aa 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.english.md @@ -41,7 +41,7 @@ Find f(10k) for k = 1018, give your answer modulo 177. ```yml tests: - text: euler405() should return 237696125. - testString: assert.strictEqual(euler405(), 237696125, 'euler405() should return 237696125.'); + testString: assert.strictEqual(euler405(), 237696125); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-406-guessing-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-406-guessing-game.english.md index 8e32718d3e..f524aab17b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-406-guessing-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-406-guessing-game.english.md @@ -43,7 +43,7 @@ Let Fk be the Fibonacci numbers: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1.Fi ```yml tests: - text: euler406() should return 36813.12757207. - testString: assert.strictEqual(euler406(), 36813.12757207, 'euler406() should return 36813.12757207.'); + testString: assert.strictEqual(euler406(), 36813.12757207); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-407-idempotents.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-407-idempotents.english.md index 7e6a7400dd..af8cc6ce5f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-407-idempotents.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-407-idempotents.english.md @@ -28,7 +28,7 @@ Find ∑M(n) for 1 ≤ n ≤ 107. ```yml tests: - text: euler407() should return 39782849136421. - testString: assert.strictEqual(euler407(), 39782849136421, 'euler407() should return 39782849136421.'); + testString: assert.strictEqual(euler407(), 39782849136421); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.english.md index 0deed44350..3caf2620e8 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.english.md @@ -29,7 +29,7 @@ Find P(10 000 000) mod 1 000 000 007. ```yml tests: - text: euler408() should return 299742733. - testString: assert.strictEqual(euler408(), 299742733, 'euler408() should return 299742733.'); + testString: assert.strictEqual(euler408(), 299742733); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-409-nim-extreme.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-409-nim-extreme.english.md index 88d5773970..b7c571e60f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-409-nim-extreme.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-409-nim-extreme.english.md @@ -26,7 +26,7 @@ Find W(10 000 000) mod 1 000 000 007. ```yml tests: - text: euler409() should return 253223948. - testString: assert.strictEqual(euler409(), 253223948, 'euler409() should return 253223948.'); + testString: assert.strictEqual(euler409(), 253223948); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-41-pandigital-prime.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-41-pandigital-prime.english.md index 1638f69c65..f8102b5508 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-41-pandigital-prime.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-41-pandigital-prime.english.md @@ -21,9 +21,9 @@ What is the largest n-length digit pandigital prime that exists? ```yml tests: - text: pandigitalPrime(4) should return 4231. - testString: assert(pandigitalPrime(4) == 4231, 'pandigitalPrime(4) should return 4231.'); + testString: assert(pandigitalPrime(4) == 4231); - text: pandigitalPrime(7) should return 7652413. - testString: assert(pandigitalPrime(7) == 7652413, 'pandigitalPrime(7) should return 7652413.'); + testString: assert(pandigitalPrime(7) == 7652413); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.english.md index 1de23af295..80c56f4855 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.english.md @@ -27,7 +27,7 @@ Find F(108, 109) + F(109, 108). ```yml tests: - text: euler410() should return 799999783589946600. - testString: assert.strictEqual(euler410(), 799999783589946600, 'euler410() should return 799999783589946600.'); + testString: assert.strictEqual(euler410(), 799999783589946600); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-411-uphill-paths.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-411-uphill-paths.english.md index 9c1d8d358a..7dd05478f7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-411-uphill-paths.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-411-uphill-paths.english.md @@ -32,7 +32,7 @@ Find ∑ S(k5) for 1 ≤ k ≤ 30. ```yml tests: - text: euler411() should return 9936352. - testString: assert.strictEqual(euler411(), 9936352, 'euler411() should return 9936352.'); + testString: assert.strictEqual(euler411(), 9936352); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-412-gnomon-numbering.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-412-gnomon-numbering.english.md index a1e8622ca6..c52649938b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-412-gnomon-numbering.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-412-gnomon-numbering.english.md @@ -34,7 +34,7 @@ Find LC(10000, 5000) mod 76543217. ```yml tests: - text: euler412() should return 38788800. - testString: assert.strictEqual(euler412(), 38788800, 'euler412() should return 38788800.'); + testString: assert.strictEqual(euler412(), 38788800); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-413-one-child-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-413-one-child-numbers.english.md index 4d50be8f9f..52e487225f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-413-one-child-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-413-one-child-numbers.english.md @@ -29,7 +29,7 @@ Find F(1019). ```yml tests: - text: euler413() should return 3079418648040719. - testString: assert.strictEqual(euler413(), 3079418648040719, 'euler413() should return 3079418648040719.'); + testString: assert.strictEqual(euler413(), 3079418648040719); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-414-kaprekar-constant.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-414-kaprekar-constant.english.md index a144b2ef4c..3f7300ccd4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-414-kaprekar-constant.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-414-kaprekar-constant.english.md @@ -51,7 +51,7 @@ Give the last 18 digits as your answer. ```yml tests: - text: euler414() should return 552506775824935500. - testString: assert.strictEqual(euler414(), 552506775824935500, 'euler414() should return 552506775824935500.'); + testString: assert.strictEqual(euler414(), 552506775824935500); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-415-titanic-sets.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-415-titanic-sets.english.md index 65f9a93e50..724f5777d3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-415-titanic-sets.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-415-titanic-sets.english.md @@ -29,7 +29,7 @@ Find T(1011) mod 108. ```yml tests: - text: euler415() should return 55859742. - testString: assert.strictEqual(euler415(), 55859742, 'euler415() should return 55859742.'); + testString: assert.strictEqual(euler415(), 55859742); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-416-a-frogs-trip.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-416-a-frogs-trip.english.md index 31fe4abd5e..1b15111541 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-416-a-frogs-trip.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-416-a-frogs-trip.english.md @@ -25,7 +25,7 @@ Find the last 9 digits of F(10, 1012). ```yml tests: - text: euler416() should return 898082747. - testString: assert.strictEqual(euler416(), 898082747, 'euler416() should return 898082747.'); + testString: assert.strictEqual(euler416(), 898082747); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.english.md index bb7acf44ee..5c1d6747ce 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.english.md @@ -42,7 +42,7 @@ Find ∑L(n) for 3 ≤ n ≤ 100 000 000 ```yml tests: - text: euler417() should return 446572970925740. - testString: assert.strictEqual(euler417(), 446572970925740, 'euler417() should return 446572970925740.'); + testString: assert.strictEqual(euler417(), 446572970925740); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-418-factorisation-triples.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-418-factorisation-triples.english.md index 069b8c2e21..34040ff5fe 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-418-factorisation-triples.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-418-factorisation-triples.english.md @@ -29,7 +29,7 @@ Find f(43!). ```yml tests: - text: euler418() should return 1177163565297340400. - testString: assert.strictEqual(euler418(), 1177163565297340400, 'euler418() should return 1177163565297340400.'); + testString: assert.strictEqual(euler418(), 1177163565297340400); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.english.md index f223f47be0..b6875819b3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.english.md @@ -37,7 +37,7 @@ E.g. for n = 40 the answer would be 31254,20259,11625 ```yml tests: - text: euler419() should return 998567458, 1046245404, 43363922. - testString: assert.strictEqual(euler419(), 998567458, 1046245404, 43363922, 'euler419() should return 998567458, 1046245404, 43363922.'); + testString: assert.strictEqual(euler419(), 998567458, 1046245404, 43363922); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md index 60cb8b38f6..e495389c13 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.english.md @@ -23,13 +23,13 @@ Using words array of n-length, how many are triangle words? ```yml tests: - text: codedTriangleNumbers(1400) should return 129. - testString: assert(codedTriangleNumbers(1400) == 129, 'codedTriangleNumbers(1400) should return 129.'); + testString: assert(codedTriangleNumbers(1400) == 129); - text: codedTriangleNumbers(1500) should return 137. - testString: assert(codedTriangleNumbers(1500) == 137, 'codedTriangleNumbers(1500) should return 137.'); + testString: assert(codedTriangleNumbers(1500) == 137); - text: codedTriangleNumbers(1600) should return 141. - testString: assert(codedTriangleNumbers(1600) == 141, 'codedTriangleNumbers(1600) should return 141.'); + testString: assert(codedTriangleNumbers(1600) == 141); - text: codedTriangleNumbers(1786) should return 162. - testString: assert(codedTriangleNumbers(1786) == 162, 'codedTriangleNumbers(1786) should return 162.'); + testString: assert(codedTriangleNumbers(1786) == 162); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.english.md index 259339314f..d445e9234b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.english.md @@ -32,7 +32,7 @@ Find F(107). ```yml tests: - text: euler420() should return 145159332. - testString: assert.strictEqual(euler420(), 145159332, 'euler420() should return 145159332.'); + testString: assert.strictEqual(euler420(), 145159332); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.english.md index b32d9e604c..ae64726e82 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.english.md @@ -28,7 +28,7 @@ Find ∑ s(n,108) for 1 ≤ n ≤ 1011. ```yml tests: - text: euler421() should return 2304215802083466200. - testString: assert.strictEqual(euler421(), 2304215802083466200, 'euler421() should return 2304215802083466200.'); + testString: assert.strictEqual(euler421(), 2304215802083466200); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.english.md index e8e59baa07..c143faa2ba 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.english.md @@ -32,7 +32,7 @@ For n = 7, the answer would have been: 806236837. ```yml tests: - text: euler422() should return 92060460. - testString: assert.strictEqual(euler422(), 92060460, 'euler422() should return 92060460.'); + testString: assert.strictEqual(euler422(), 92060460); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.english.md index 6b7af94dfc..e1a6a0cbe4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.english.md @@ -37,7 +37,7 @@ Find S(50 000 000) mod 1 000 000 007. ```yml tests: - text: euler423() should return 653972374. - testString: assert.strictEqual(euler423(), 653972374, 'euler423() should return 653972374.'); + testString: assert.strictEqual(euler423(), 653972374); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-424-kakuro.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-424-kakuro.english.md index 0a75e425e4..fda86f9e1d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-424-kakuro.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-424-kakuro.english.md @@ -40,7 +40,7 @@ Find the sum of the answers for the 200 puzzles. ```yml tests: - text: euler424() should return 1059760019628. - testString: assert.strictEqual(euler424(), 1059760019628, 'euler424() should return 1059760019628.'); + testString: assert.strictEqual(euler424(), 1059760019628); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-425-prime-connection.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-425-prime-connection.english.md index 50fa1a9b4d..0ba527c60f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-425-prime-connection.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-425-prime-connection.english.md @@ -37,7 +37,7 @@ Find F(107). ```yml tests: - text: euler425() should return 46479497324. - testString: assert.strictEqual(euler425(), 46479497324, 'euler425() should return 46479497324.'); + testString: assert.strictEqual(euler425(), 46479497324); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-426-box-ball-system.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-426-box-ball-system.english.md index 6071a635fa..80f5828c90 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-426-box-ball-system.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-426-box-ball-system.english.md @@ -49,7 +49,7 @@ Give as your answer the sum of the squares of the elements of the final state. F ```yml tests: - text: euler426() should return 31591886008. - testString: assert.strictEqual(euler426(), 31591886008, 'euler426() should return 31591886008.'); + testString: assert.strictEqual(euler426(), 31591886008); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-427-n-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-427-n-sequences.english.md index f34a455157..77bd8cefad 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-427-n-sequences.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-427-n-sequences.english.md @@ -30,7 +30,7 @@ Find f(7 500 000) mod 1 000 000 009. ```yml tests: - text: euler427() should return 97138867. - testString: assert.strictEqual(euler427(), 97138867, 'euler427() should return 97138867.'); + testString: assert.strictEqual(euler427(), 97138867); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-428-necklace-of-circles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-428-necklace-of-circles.english.md index e3653c58a2..45fd3f5f4d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-428-necklace-of-circles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-428-necklace-of-circles.english.md @@ -33,7 +33,7 @@ Find T(1 000 000 000). ```yml tests: - text: necklace(1000000000) should return 747215561862. - testString: assert.strictEqual(necklace(1000000000), 747215561862, 'necklace(1000000000) should return 747215561862.'); + testString: assert.strictEqual(necklace(1000000000), 747215561862); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.english.md index 996f8101df..cd28a1bf9b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.english.md @@ -28,7 +28,7 @@ Find S(100 000 000!) modulo 1 000 000 009. ```yml tests: - text: euler429() should return 98792821. - testString: assert.strictEqual(euler429(), 98792821, 'euler429() should return 98792821.'); + testString: assert.strictEqual(euler429(), 98792821); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.english.md index c2402da353..70d6c92f3e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.english.md @@ -29,7 +29,7 @@ Find the numbers of all 0 to 9 pandigital numbers with this property. ```yml tests: - text: substringDivisibility() should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ]. - testString: assert.deepEqual(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ], 'substringDivisibility() should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].'); + testString: assert.deepEqual(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ]); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-430-range-flips.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-430-range-flips.english.md index 7c23896c0c..7044e1c3ec 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-430-range-flips.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-430-range-flips.english.md @@ -34,7 +34,7 @@ Give your answer rounded to 2 decimal places behind the decimal point. ```yml tests: - text: euler430() should return 5000624921.38. - testString: assert.strictEqual(euler430(), 5000624921.38, 'euler430() should return 5000624921.38.'); + testString: assert.strictEqual(euler430(), 5000624921.38); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-431-square-space-silo.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-431-square-space-silo.english.md index dc5fc50ea6..59cbae9f69 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-431-square-space-silo.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-431-square-space-silo.english.md @@ -31,7 +31,7 @@ If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's ap ```yml tests: - text: euler431() should return 23.386029052. - testString: assert.strictEqual(euler431(), 23.386029052, 'euler431() should return 23.386029052.'); + testString: assert.strictEqual(euler431(), 23.386029052); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-432-totient-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-432-totient-sum.english.md index 40fbe0ab15..d8e59c737d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-432-totient-sum.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-432-totient-sum.english.md @@ -25,7 +25,7 @@ Give the last 9 digits of your answer. ```yml tests: - text: euler432() should return 754862080. - testString: assert.strictEqual(euler432(), 754862080, 'euler432() should return 754862080.'); + testString: assert.strictEqual(euler432(), 754862080); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.english.md index 0698a4bde5..b0b25f06f5 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.english.md @@ -31,7 +31,7 @@ Find S(5·106). ```yml tests: - text: euler433() should return 326624372659664. - testString: assert.strictEqual(euler433(), 326624372659664, 'euler433() should return 326624372659664.'); + testString: assert.strictEqual(euler433(), 326624372659664); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-434-rigid-graphs.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-434-rigid-graphs.english.md index 0688454971..aa9e061cd2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-434-rigid-graphs.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-434-rigid-graphs.english.md @@ -35,7 +35,7 @@ Find S(100), give your answer modulo 1000000033 ```yml tests: - text: euler434() should return 863253606. - testString: assert.strictEqual(euler434(), 863253606, 'euler434() should return 863253606.'); + testString: assert.strictEqual(euler434(), 863253606); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.english.md index e85a4ecf19..3c60ec2f81 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.english.md @@ -23,7 +23,7 @@ Let n = 1015. Find the sum [∑0≤x≤100 Fn(x)] mod 1307674368000 (= 15!). ```yml tests: - text: euler435() should return 252541322550. - testString: assert.strictEqual(euler435(), 252541322550, 'euler435() should return 252541322550.'); + testString: assert.strictEqual(euler435(), 252541322550); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-436-unfair-wager.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-436-unfair-wager.english.md index 1ac2759d08..29eb8c710e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-436-unfair-wager.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-436-unfair-wager.english.md @@ -34,7 +34,7 @@ Give your answer rounded to 10 places behind the decimal point in the form 0.abc ```yml tests: - text: euler436() should return 0.5276662759. - testString: assert.strictEqual(euler436(), 0.5276662759, 'euler436() should return 0.5276662759.'); + testString: assert.strictEqual(euler436(), 0.5276662759); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.english.md index 23155c7e79..bad7a008e7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.english.md @@ -38,7 +38,7 @@ Find the sum of the primes less than 100,000,000 with at least one Fibonacci pri ```yml tests: - text: euler437() should return 74204709657207. - testString: assert.strictEqual(euler437(), 74204709657207, 'euler437() should return 74204709657207.'); + testString: assert.strictEqual(euler437(), 74204709657207); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.english.md index 9526de029e..bce4e5b1b4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.english.md @@ -32,7 +32,7 @@ Find ∑S(t) for n = 7. ```yml tests: - text: euler438() should return 2046409616809. - testString: assert.strictEqual(euler438(), 2046409616809, 'euler438() should return 2046409616809.'); + testString: assert.strictEqual(euler438(), 2046409616809); ```