diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.english.md index 6fdd986b7c..cc7ff59fac 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.english.md @@ -24,7 +24,7 @@ Find . ```yml tests: - text: euler303() should return 1111981904675169. - testString: assert.strictEqual(euler303(), 1111981904675169, 'euler303() should return 1111981904675169.'); + testString: assert.strictEqual(euler303(), 1111981904675169); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-304-primonacci.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-304-primonacci.english.md index 729914e6da..4cd25991a3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-304-primonacci.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-304-primonacci.english.md @@ -35,7 +35,7 @@ Give your answer mod 1234567891011. ```yml tests: - text: euler304() should return 283988410192. - testString: assert.strictEqual(euler304(), 283988410192, 'euler304() should return 283988410192.'); + testString: assert.strictEqual(euler304(), 283988410192); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-305-reflexive-position.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-305-reflexive-position.english.md index 1991b6f729..692ffc6de7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-305-reflexive-position.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-305-reflexive-position.english.md @@ -31,7 +31,7 @@ Find ∑f(3k) for 1≤k≤13. ```yml tests: - text: euler305() should return 18174995535140. - testString: assert.strictEqual(euler305(), 18174995535140, 'euler305() should return 18174995535140.'); + testString: assert.strictEqual(euler305(), 18174995535140); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-306-paper-strip-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-306-paper-strip-game.english.md index dbe10eb339..09e3b357c7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-306-paper-strip-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-306-paper-strip-game.english.md @@ -37,7 +37,7 @@ For 1 ≤ n ≤ 1 000 000, how many values of n are there for which the first pl ```yml tests: - text: euler306() should return 852938. - testString: assert.strictEqual(euler306(), 852938, 'euler306() should return 852938.'); + testString: assert.strictEqual(euler306(), 852938); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-307-chip-defects.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-307-chip-defects.english.md index 94e086284a..e1eeb4e19d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-307-chip-defects.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-307-chip-defects.english.md @@ -27,7 +27,7 @@ Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in t ```yml tests: - text: euler307() should return 0.7311720251. - testString: assert.strictEqual(euler307(), 0.7311720251, 'euler307() should return 0.7311720251.'); + testString: assert.strictEqual(euler307(), 0.7311720251); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.english.md index 7b4b317d70..5bc99d74a8 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.english.md @@ -58,7 +58,7 @@ If someone uses the above Fractran program to solve Project Euler Problem 7 (fin ```yml tests: - text: euler308() should return 1539669807660924. - testString: assert.strictEqual(euler308(), 1539669807660924, 'euler308() should return 1539669807660924.'); + testString: assert.strictEqual(euler308(), 1539669807660924); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-309-integer-ladders.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-309-integer-ladders.english.md index 3be765a03d..7e12bfd232 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-309-integer-ladders.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-309-integer-ladders.english.md @@ -30,7 +30,7 @@ For integer values x, y, h and 0 < x < y < 1 000 000, how many triplets (x,y,h) ```yml tests: - text: euler309() should return 210139. - testString: assert.strictEqual(euler309(), 210139, 'euler309() should return 210139.'); + testString: assert.strictEqual(euler309(), 210139); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-31-coin-sums.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-31-coin-sums.english.md index 1c2a4e9075..b6892a161a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-31-coin-sums.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-31-coin-sums.english.md @@ -24,13 +24,13 @@ How many different ways can £(n) be made using any number of coins? ```yml tests: - text: coinSums(50) should return 451. - testString: assert(coinSums(50) == 451, 'coinSums(50) should return 451.'); + testString: assert(coinSums(50) == 451); - text: coinSums(100) should return 4563. - testString: assert(coinSums(100) == 4563, 'coinSums(100) should return 4563.'); + testString: assert(coinSums(100) == 4563); - text: coinSums(150) should return 21873. - testString: assert(coinSums(150) == 21873, 'coinSums(150) should return 21873.'); + testString: assert(coinSums(150) == 21873); - text: coinSums(200) should return 73682. - testString: assert(coinSums(200) == 73682, 'coinSums(200) should return 73682.'); + testString: assert(coinSums(200) == 73682); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-310-nim-square.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-310-nim-square.english.md index 259529dbe7..495aac1315 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-310-nim-square.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-310-nim-square.english.md @@ -26,7 +26,7 @@ Find the number of losing positions for the next player if 0≤a≤b≤c≤100 0 ```yml tests: - text: euler310() should return 2586528661783. - testString: assert.strictEqual(euler310(), 2586528661783, 'euler310() should return 2586528661783.'); + testString: assert.strictEqual(euler310(), 2586528661783); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.english.md index a63d6d7405..41ff425225 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.english.md @@ -34,7 +34,7 @@ Find B(10 000 000 000). ```yml tests: - text: euler311() should return 2466018557. - testString: assert.strictEqual(euler311(), 2466018557, 'euler311() should return 2466018557.'); + testString: assert.strictEqual(euler311(), 2466018557); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.english.md index d4c82390d3..d60f172f4c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.english.md @@ -38,7 +38,7 @@ Find C(C(C(10 000))) mod 138. ```yml tests: - text: euler312() should return 324681947. - testString: assert.strictEqual(euler312(), 324681947, 'euler312() should return 324681947.'); + testString: assert.strictEqual(euler312(), 324681947); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-313-sliding-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-313-sliding-game.english.md index b9015b0527..460c1b2cfb 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-313-sliding-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-313-sliding-game.english.md @@ -30,7 +30,7 @@ How many grids does S(m,n) = p2, where p < 106 is prime? ```yml tests: - text: euler313() should return 2057774861813004. - testString: assert.strictEqual(euler313(), 2057774861813004, 'euler313() should return 2057774861813004.'); + testString: assert.strictEqual(euler313(), 2057774861813004); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.english.md index ec31a9c17a..515c21ca8d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.english.md @@ -37,7 +37,7 @@ Give your answer rounded to 8 places behind the decimal point in the form abc.de ```yml tests: - text: euler314() should return 132.52756426. - testString: assert.strictEqual(euler314(), 132.52756426, 'euler314() should return 132.52756426.'); + testString: assert.strictEqual(euler314(), 132.52756426); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-315-digital-root-clocks.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-315-digital-root-clocks.english.md index 6706a1a3a6..c8b88fcdf8 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-315-digital-root-clocks.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-315-digital-root-clocks.english.md @@ -66,7 +66,7 @@ Find the difference between the total number of transitions needed by Sam's cloc ```yml tests: - text: euler315() should return 13625242. - testString: assert.strictEqual(euler315(), 13625242, 'euler315() should return 13625242.'); + testString: assert.strictEqual(euler315(), 13625242); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.english.md index 2cc86d53c7..6ca99ad859 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.english.md @@ -34,7 +34,7 @@ Note: represents the floor function. ```yml tests: - text: euler316() should return 542934735751917760. - testString: assert.strictEqual(euler316(), 542934735751917760, 'euler316() should return 542934735751917760.'); + testString: assert.strictEqual(euler316(), 542934735751917760); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-317-firecracker.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-317-firecracker.english.md index 483946d881..9bc9bbac71 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-317-firecracker.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-317-firecracker.english.md @@ -27,7 +27,7 @@ Give your answer rounded to four decimal places. ```yml tests: - text: euler317() should return 1856532.8455. - testString: assert.strictEqual(euler317(), 1856532.8455, 'euler317() should return 1856532.8455.'); + testString: assert.strictEqual(euler317(), 1856532.8455); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-318-2011-nines.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-318-2011-nines.english.md index 4afb977a05..927e8fec79 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-318-2011-nines.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-318-2011-nines.english.md @@ -46,7 +46,7 @@ Find ∑N(p,q) for p+q ≤ 2011. ```yml tests: - text: euler318() should return 709313889. - testString: assert.strictEqual(euler318(), 709313889, 'euler318() should return 709313889.'); + testString: assert.strictEqual(euler318(), 709313889); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-319-bounded-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-319-bounded-sequences.english.md index 04ef47f095..edaef1a28f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-319-bounded-sequences.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-319-bounded-sequences.english.md @@ -35,7 +35,7 @@ Find t(1010) and give your answer modulo 109. ```yml tests: - text: euler319() should return 268457129. - testString: assert.strictEqual(euler319(), 268457129, 'euler319() should return 268457129.'); + testString: assert.strictEqual(euler319(), 268457129); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-32-pandigital-products.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-32-pandigital-products.english.md index 18af70928f..9fcb99bfb5 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-32-pandigital-products.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-32-pandigital-products.english.md @@ -26,9 +26,9 @@ HINT: Some products can be obtained in more than one way so be sure to only incl ```yml tests: - text: pandigitalProducts() is a function. - testString: assert(typeof pandigitalProducts === 'function', 'pandigitalProducts() is a function.'); + testString: assert(typeof pandigitalProducts === 'function'); - text: pandigitalProducts() should return 45228. - testString: assert.strictEqual(pandigitalProducts(), 45228, 'pandigitalProducts() should return 45228.'); + testString: assert.strictEqual(pandigitalProducts(), 45228); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.english.md index e638a1b231..c7f140c709 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.english.md @@ -28,7 +28,7 @@ Find S(1 000 000) mod 1018. ```yml tests: - text: euler320() should return 278157919195482660. - testString: assert.strictEqual(euler320(), 278157919195482660, 'euler320() should return 278157919195482660.'); + testString: assert.strictEqual(euler320(), 278157919195482660); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-321-swapping-counters.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-321-swapping-counters.english.md index 43227dbdeb..9463da6098 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-321-swapping-counters.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-321-swapping-counters.english.md @@ -34,7 +34,7 @@ Find the sum of the first forty terms of this sequence. ```yml tests: - text: euler321() should return 2470433131948040. - testString: assert.strictEqual(euler321(), 2470433131948040, 'euler321() should return 2470433131948040.'); + testString: assert.strictEqual(euler321(), 2470433131948040); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.english.md index e7457bebc2..0000a39449 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.english.md @@ -24,7 +24,7 @@ Find T(1018, 1012-10). ```yml tests: - text: euler322() should return 999998760323314000. - testString: assert.strictEqual(euler322(), 999998760323314000, 'euler322() should return 999998760323314000.'); + testString: assert.strictEqual(euler322(), 999998760323314000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.english.md index bbbb4a50ff..fa14ccf706 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.english.md @@ -27,7 +27,7 @@ Give your answer rounded to 10 digits after the decimal point. ```yml tests: - text: euler323() should return 6.3551758451. - testString: assert.strictEqual(euler323(), 6.3551758451, 'euler323() should return 6.3551758451.'); + testString: assert.strictEqual(euler323(), 6.3551758451); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-324-building-a-tower.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-324-building-a-tower.english.md index 0f9e6dc5c7..09461ae229 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-324-building-a-tower.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-324-building-a-tower.english.md @@ -23,7 +23,7 @@ Find f(1010000) mod 100000007. ```yml tests: - text: euler324() should return 96972774. - testString: assert.strictEqual(euler324(), 96972774, 'euler324() should return 96972774.'); + testString: assert.strictEqual(euler324(), 96972774); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-325-stone-game-ii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-325-stone-game-ii.english.md index 77fa23bb29..3638a7f39b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-325-stone-game-ii.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-325-stone-game-ii.english.md @@ -44,7 +44,7 @@ Find S(1016) mod 710. ```yml tests: - text: euler325() should return 54672965. - testString: assert.strictEqual(euler325(), 54672965, 'euler325() should return 54672965.'); + testString: assert.strictEqual(euler325(), 54672965); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-326-modulo-summations.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-326-modulo-summations.english.md index c0e2c48879..ea068b9f6e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-326-modulo-summations.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-326-modulo-summations.english.md @@ -33,7 +33,7 @@ Find f(1012,106). ```yml tests: - text: euler326() should return 1966666166408794400. - testString: assert.strictEqual(euler326(), 1966666166408794400, 'euler326() should return 1966666166408794400.'); + testString: assert.strictEqual(euler326(), 1966666166408794400); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-327-rooms-of-doom.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-327-rooms-of-doom.english.md index b6ec9c53c3..081ce15767 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-327-rooms-of-doom.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-327-rooms-of-doom.english.md @@ -41,7 +41,7 @@ Find ΣM(C,30) for 3 ≤ C ≤ 40. ```yml tests: - text: euler327() should return 34315549139516. - testString: assert.strictEqual(euler327(), 34315549139516, 'euler327() should return 34315549139516.'); + testString: assert.strictEqual(euler327(), 34315549139516); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-328-lowest-cost-search.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-328-lowest-cost-search.english.md index 8c655de219..8b6c58d70b 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-328-lowest-cost-search.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-328-lowest-cost-search.english.md @@ -42,7 +42,7 @@ Find C(n). ```yml tests: - text: euler328() should return 260511850222. - testString: assert.strictEqual(euler328(), 260511850222, 'euler328() should return 260511850222.'); + testString: assert.strictEqual(euler328(), 260511850222); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-329-prime-frog.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-329-prime-frog.english.md index 91331e548f..c16147817c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-329-prime-frog.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-329-prime-frog.english.md @@ -31,7 +31,7 @@ Give your answer as a fraction p/q in reduced form. ```yml tests: - text: euler329() should return 199740353 / 29386561536000. - testString: assert.strictEqual(euler329(), 199740353 / 29386561536000, 'euler329() should return 199740353 / 29386561536000.'); + testString: assert.strictEqual(euler329(), 199740353 / 29386561536000); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.english.md index 97b6000466..ecbc4a3514 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.english.md @@ -23,7 +23,7 @@ If the product of these four fractions is given in its lowest common terms, find ```yml tests: - text: digitCancellingFractions() should return 100. - testString: assert.strictEqual(digitCancellingFractions(), 100, 'digitCancellingFractions() should return 100.'); + testString: assert.strictEqual(digitCancellingFractions(), 100); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-330-eulers-number.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-330-eulers-number.english.md index 654c9b0227..d462b7cbae 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-330-eulers-number.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-330-eulers-number.english.md @@ -39,7 +39,7 @@ Find A(109) + B(109) and give your answer mod 77 777 777. ```yml tests: - text: euler330() should return 15955822. - testString: assert.strictEqual(euler330(), 15955822, 'euler330() should return 15955822.'); + testString: assert.strictEqual(euler330(), 15955822); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-331-cross-flips.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-331-cross-flips.english.md index 3f73037c0f..b609843c7f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-331-cross-flips.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-331-cross-flips.english.md @@ -37,7 +37,7 @@ Find . ```yml tests: - text: euler331() should return 467178235146843500. - testString: assert.strictEqual(euler331(), 467178235146843500, 'euler331() should return 467178235146843500.'); + testString: assert.strictEqual(euler331(), 467178235146843500); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-332-spherical-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-332-spherical-triangles.english.md index 21f8930b5a..8ace9fb69a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-332-spherical-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-332-spherical-triangles.english.md @@ -33,7 +33,7 @@ Find A(r). Give your answer rounded to six decimal places. ```yml tests: - text: euler332() should return 2717.751525. - testString: assert.strictEqual(euler332(), 2717.751525, 'euler332() should return 2717.751525.'); + testString: assert.strictEqual(euler332(), 2717.751525); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-333-special-partitions.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-333-special-partitions.english.md index e3c7fd6fd8..ed45559a5c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-333-special-partitions.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-333-special-partitions.english.md @@ -35,7 +35,7 @@ Find the sum of the primes q <1000000 such that P(q)=1. ```yml tests: - text: euler333() should return 3053105. - testString: assert.strictEqual(euler333(), 3053105, 'euler333() should return 3053105.'); + testString: assert.strictEqual(euler333(), 3053105); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-334-spilling-the-beans.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-334-spilling-the-beans.english.md index cde2618d79..406d9c2cff 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-334-spilling-the-beans.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-334-spilling-the-beans.english.md @@ -43,7 +43,7 @@ Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively ```yml tests: - text: euler334() should return 150320021261690850. - testString: assert.strictEqual(euler334(), 150320021261690850, 'euler334() should return 150320021261690850.'); + testString: assert.strictEqual(euler334(), 150320021261690850); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-335-gathering-the-beans.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-335-gathering-the-beans.english.md index a2fb725d5a..ea525ace92 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-335-gathering-the-beans.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-335-gathering-the-beans.english.md @@ -28,7 +28,7 @@ Find M(2k+1). Give your answer modulo 79. ```yml tests: - text: euler335() should return 5032316. - testString: assert.strictEqual(euler335(), 5032316, 'euler335() should return 5032316.'); + testString: assert.strictEqual(euler335(), 5032316); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-336-maximix-arrangements.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-336-maximix-arrangements.english.md index bf55664407..39c4c60761 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-336-maximix-arrangements.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-336-maximix-arrangements.english.md @@ -33,7 +33,7 @@ Find the 2011th lexicographic maximix arrangement for eleven carriages. ```yml tests: - text: euler336() should return CAGBIHEFJDK. - testString: assert.strictEqual(euler336(), CAGBIHEFJDK, 'euler336() should return CAGBIHEFJDK.'); + testString: assert.strictEqual(euler336(), CAGBIHEFJDK); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.english.md index d76297c6d2..990302b08d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.english.md @@ -29,7 +29,7 @@ Find S(20 000 000) mod 108. ```yml tests: - text: euler337() should return 85068035. - testString: assert.strictEqual(euler337(), 85068035, 'euler337() should return 85068035.'); + testString: assert.strictEqual(euler337(), 85068035); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.english.md index c867752ec4..ac039107cd 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.english.md @@ -37,7 +37,7 @@ Find G(1012). Give your answer modulo 108. ```yml tests: - text: euler338() should return 15614292. - testString: assert.strictEqual(euler338(), 15614292, 'euler338() should return 15614292.'); + testString: assert.strictEqual(euler338(), 15614292); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.english.md index 5303cf3a27..4ba6a7cd43 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.english.md @@ -29,7 +29,7 @@ Find E(10 000) and give your answer rounded to 6 places behind the decimal point ```yml tests: - text: euler339() should return 19823.542204. - testString: assert.strictEqual(euler339(), 19823.542204, 'euler339() should return 19823.542204.'); + testString: assert.strictEqual(euler339(), 19823.542204); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-340-crazy-function.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-340-crazy-function.english.md index ab76cd41b3..6d96767177 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-340-crazy-function.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-340-crazy-function.english.md @@ -32,7 +32,7 @@ Find the last 9 digits of S(217, 721, 127). ```yml tests: - text: euler340() should return 291504964. - testString: assert.strictEqual(euler340(), 291504964, 'euler340() should return 291504964.'); + testString: assert.strictEqual(euler340(), 291504964); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.english.md index 9788d053d0..391cfae5b9 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.english.md @@ -28,7 +28,7 @@ Find ΣG(n3) for 1 ≤ n < 106. ```yml tests: - text: euler341() should return 56098610614277016. - testString: assert.strictEqual(euler341(), 56098610614277016, 'euler341() should return 56098610614277016.'); + testString: assert.strictEqual(euler341(), 56098610614277016); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.english.md index 7fc457121b..059675a752 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.english.md @@ -28,7 +28,7 @@ Find the sum of all numbers n, 1 < n < 1010 such that φ(n2) is a cube. ```yml tests: - text: euler342() should return 5943040885644. - testString: assert.strictEqual(euler342(), 5943040885644, 'euler342() should return 5943040885644.'); + testString: assert.strictEqual(euler342(), 5943040885644); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-343-fractional-sequences.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-343-fractional-sequences.english.md index af1e24f79c..b8d93b4c33 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-343-fractional-sequences.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-343-fractional-sequences.english.md @@ -41,7 +41,7 @@ Find Σf(k3) for 1 ≤ k ≤ 2×106. ```yml tests: - text: euler343() should return 269533451410884200. - testString: assert.strictEqual(euler343(), 269533451410884200, 'euler343() should return 269533451410884200.'); + testString: assert.strictEqual(euler343(), 269533451410884200); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-344-silver-dollar-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-344-silver-dollar-game.english.md index 1c37ea448e..6d06ae07d3 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-344-silver-dollar-game.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-344-silver-dollar-game.english.md @@ -40,7 +40,7 @@ Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 0 ```yml tests: - text: euler344() should return 65579304332. - testString: assert.strictEqual(euler344(), 65579304332, 'euler344() should return 65579304332.'); + testString: assert.strictEqual(euler344(), 65579304332); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-345-matrix-sum.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-345-matrix-sum.english.md index c0ecef4bcf..41c7fc6342 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-345-matrix-sum.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-345-matrix-sum.english.md @@ -45,7 +45,7 @@ Find the Matrix Sum of: ```yml tests: - text: euler345() should return 13938. - testString: assert.strictEqual(euler345(), 13938, 'euler345() should return 13938.'); + testString: assert.strictEqual(euler345(), 13938); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-346-strong-repunits.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-346-strong-repunits.english.md index 91d83aa385..b94640a34a 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-346-strong-repunits.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-346-strong-repunits.english.md @@ -25,7 +25,7 @@ Find the sum of all strong repunits below 1012. ```yml tests: - text: euler346() should return 336108797689259260. - testString: assert.strictEqual(euler346(), 336108797689259260, 'euler346() should return 336108797689259260.'); + testString: assert.strictEqual(euler346(), 336108797689259260); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.english.md index 88fc9bbfaf..5a2a6f5953 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.english.md @@ -34,7 +34,7 @@ Find S(10 000 000). ```yml tests: - text: euler347() should return 11109800204052. - testString: assert.strictEqual(euler347(), 11109800204052, 'euler347() should return 11109800204052.'); + testString: assert.strictEqual(euler347(), 11109800204052); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.english.md index ea5f1ee220..e133f44e94 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.english.md @@ -29,7 +29,7 @@ Find the sum of the five smallest such palindromic numbers. ```yml tests: - text: euler348() should return 1004195061. - testString: assert.strictEqual(euler348(), 1004195061, 'euler348() should return 1004195061.'); + testString: assert.strictEqual(euler348(), 1004195061); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-349-langtons-ant.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-349-langtons-ant.english.md index 13a8feedb9..49600786cb 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-349-langtons-ant.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-349-langtons-ant.english.md @@ -25,7 +25,7 @@ Starting with a grid that is entirely white, how many squares are black after 10 ```yml tests: - text: euler349() should return 115384615384614940. - testString: assert.strictEqual(euler349(), 115384615384614940, 'euler349() should return 115384615384614940.'); + testString: assert.strictEqual(euler349(), 115384615384614940); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-35-circular-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-35-circular-primes.english.md index 84bab43cbe..c5f962fd85 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-35-circular-primes.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-35-circular-primes.english.md @@ -25,17 +25,17 @@ Circular primes individual rotation can exceeed `n`. ```yml tests: - text: circularPrimes(100) should return 13. - testString: assert(circularPrimes(100) == 13, 'circularPrimes(100) should return 13.'); + testString: assert(circularPrimes(100) == 13); - text: circularPrimes(100000) should return 43. - testString: assert(circularPrimes(100000) == 43, 'circularPrimes(100000) should return 43.'); + testString: assert(circularPrimes(100000) == 43); - text: circularPrimes(250000) should return 45. - testString: assert(circularPrimes(250000) == 45, 'circularPrimes(250000) should return 45.'); + testString: assert(circularPrimes(250000) == 45); - text: circularPrimes(500000) should return 49. - testString: assert(circularPrimes(500000) == 49, 'circularPrimes(500000) should return 49.'); + testString: assert(circularPrimes(500000) == 49); - text: circularPrimes(750000) should return 49. - testString: assert(circularPrimes(750000) == 49, 'circularPrimes(750000) should return 49.'); + testString: assert(circularPrimes(750000) == 49); - text: circularPrimes(1000000) should return 55. - testString: assert(circularPrimes(1000000) == 55, 'circularPrimes(1000000) should return 55.'); + testString: assert(circularPrimes(1000000) == 55); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.english.md index c55833405f..6d226b86b4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.english.md @@ -33,7 +33,7 @@ Find f(106, 1012, 1018) mod 1014. ```yml tests: - text: euler350() should return 84664213. - testString: assert.strictEqual(euler350(), 84664213, 'euler350() should return 84664213.'); + testString: assert.strictEqual(euler350(), 84664213); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.english.md index 6bdc942be3..490260f984 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.english.md @@ -39,7 +39,7 @@ Find H(100 000 000). ```yml tests: - text: euler351() should return 11762187201804552. - testString: assert.strictEqual(euler351(), 11762187201804552, 'euler351() should return 11762187201804552.'); + testString: assert.strictEqual(euler351(), 11762187201804552); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-352-blood-tests.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-352-blood-tests.english.md index c2675a5847..902de2b4f7 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-352-blood-tests.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-352-blood-tests.english.md @@ -57,7 +57,7 @@ Give your answer rounded to six decimal places. ```yml tests: - text: euler352() should return 378563.260589. - testString: assert.strictEqual(euler352(), 378563.260589, 'euler352() should return 378563.260589.'); + testString: assert.strictEqual(euler352(), 378563.260589); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-353-risky-moon.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-353-risky-moon.english.md index 88f058f9e6..971b77868c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-353-risky-moon.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-353-risky-moon.english.md @@ -48,7 +48,7 @@ Give your answer rounded to 10 digits behind the decimal point in the form a.bcd ```yml tests: - text: euler353() should return 1.2759860331. - testString: assert.strictEqual(euler353(), 1.2759860331, 'euler353() should return 1.2759860331.'); + testString: assert.strictEqual(euler353(), 1.2759860331); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.english.md index 83f2cfd3af..6fc63334d2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.english.md @@ -31,7 +31,7 @@ Find the number of L ≤ 5·1011 such that B(L) = 450. ```yml tests: - text: euler354() should return 58065134. - testString: assert.strictEqual(euler354(), 58065134, 'euler354() should return 58065134.'); + testString: assert.strictEqual(euler354(), 58065134); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.english.md index cfa1f39f9a..ad4f12eca2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.english.md @@ -27,7 +27,7 @@ Find Co(200000). ```yml tests: - text: euler355() should return 1726545007. - testString: assert.strictEqual(euler355(), 1726545007, 'euler355() should return 1726545007.'); + testString: assert.strictEqual(euler355(), 1726545007); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md index fc2d1efcae..3ae4037c94 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.english.md @@ -27,7 +27,7 @@ Note: represents the floor function. ```yml tests: - text: euler356() should return 28010159. - testString: assert.strictEqual(euler356(), 28010159, 'euler356() should return 28010159.'); + testString: assert.strictEqual(euler356(), 28010159); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.english.md index 3190a4816b..2a4cb14ef2 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.english.md @@ -25,7 +25,7 @@ for every divisor d of n, d+n/d is prime. ```yml tests: - text: euler357() should return 1739023853137. - testString: assert.strictEqual(euler357(), 1739023853137, 'euler357() should return 1739023853137.'); + testString: assert.strictEqual(euler357(), 1739023853137); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-358-cyclic-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-358-cyclic-numbers.english.md index 91e3726644..4abaa8e34e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-358-cyclic-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-358-cyclic-numbers.english.md @@ -48,7 +48,7 @@ There is only one cyclic number for which, the eleven leftmost digits are 000000 ```yml tests: - text: euler358() should return 3284144505. - testString: assert.strictEqual(euler358(), 3284144505, 'euler358() should return 3284144505.'); + testString: assert.strictEqual(euler358(), 3284144505); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.english.md index e75b88f963..f52d57a8fc 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.english.md @@ -49,7 +49,7 @@ Find the sum of all P(f, r) for all positive f and r such that f × r = 71328803 ```yml tests: - text: euler359() should return 40632119. - testString: assert.strictEqual(euler359(), 40632119, 'euler359() should return 40632119.'); + testString: assert.strictEqual(euler359(), 40632119); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.english.md index 07e2aa6bdc..d4749825a4 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-36-double-base-palindromes.english.md @@ -22,13 +22,13 @@ Find the sum of all numbers, less than n, whereas 1000 <= n <= 1000000, which ar ```yml tests: - text: doubleBasePalindromes(1000) should return 1772. - testString: assert(doubleBasePalindromes(1000) == 1772, 'doubleBasePalindromes(1000) should return 1772.'); + testString: assert(doubleBasePalindromes(1000) == 1772); - text: doubleBasePalindromes(50000) should return 105795. - testString: assert(doubleBasePalindromes(50000) == 105795, 'doubleBasePalindromes(50000) should return 105795.'); + testString: assert(doubleBasePalindromes(50000) == 105795); - text: doubleBasePalindromes(500000) should return 286602. - testString: assert(doubleBasePalindromes(500000) == 286602, 'doubleBasePalindromes(500000) should return 286602.'); + testString: assert(doubleBasePalindromes(500000) == 286602); - text: doubleBasePalindromes(1000000) should return 872187. - testString: assert(doubleBasePalindromes(1000000) == 872187, 'doubleBasePalindromes(1000000) should return 872187.'); + testString: assert(doubleBasePalindromes(1000000) == 872187); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-360-scary-sphere.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-360-scary-sphere.english.md index c5a3bd4e34..17ed5b09e6 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-360-scary-sphere.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-360-scary-sphere.english.md @@ -31,7 +31,7 @@ Find S(1010). ```yml tests: - text: euler360() should return 878825614395267100. - testString: assert.strictEqual(euler360(), 878825614395267100, 'euler360() should return 878825614395267100.'); + testString: assert.strictEqual(euler360(), 878825614395267100); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.english.md index 46691e3a35..50d735311e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.english.md @@ -45,7 +45,7 @@ Find the last 9 digits of . ```yml tests: - text: euler361() should return 178476944. - testString: assert.strictEqual(euler361(), 178476944, 'euler361() should return 178476944.'); + testString: assert.strictEqual(euler361(), 178476944); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-362-squarefree-factors.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-362-squarefree-factors.english.md index ea672a21d3..f342f2649e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-362-squarefree-factors.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-362-squarefree-factors.english.md @@ -36,7 +36,7 @@ Find S(10 000 000 000). ```yml tests: - text: euler362() should return 457895958010. - testString: assert.strictEqual(euler362(), 457895958010, 'euler362() should return 457895958010.'); + testString: assert.strictEqual(euler362(), 457895958010); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-363-bzier-curves.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-363-bzier-curves.english.md index 5eefc581a9..8ec11fbe4e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-363-bzier-curves.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-363-bzier-curves.english.md @@ -41,7 +41,7 @@ That is, if L is the length of the curve, calculate 100 × L − π/2π/2Give y ```yml tests: - text: euler363() should return 0.0000372091. - testString: assert.strictEqual(euler363(), 0.0000372091, 'euler363() should return 0.0000372091.'); + testString: assert.strictEqual(euler363(), 0.0000372091); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-364-comfortable-distance.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-364-comfortable-distance.english.md index 231d9e711a..263f6f1422 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-364-comfortable-distance.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-364-comfortable-distance.english.md @@ -32,7 +32,7 @@ Find T(1 000 000) mod 100 000 007. ```yml tests: - text: euler364() should return 44855254. - testString: assert.strictEqual(euler364(), 44855254, 'euler364() should return 44855254.'); + testString: assert.strictEqual(euler364(), 44855254); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.english.md index dd3a23ffbd..8be1c63dce 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.english.md @@ -26,7 +26,7 @@ Calculate ∑M(1018,109,p*q*r) for 1000euler365() should return 162619462356610300. - testString: assert.strictEqual(euler365(), 162619462356610300, 'euler365() should return 162619462356610300.'); + testString: assert.strictEqual(euler365(), 162619462356610300); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-366-stone-game-iii.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-366-stone-game-iii.english.md index 716b326b2a..42f026e9c0 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-366-stone-game-iii.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-366-stone-game-iii.english.md @@ -43,7 +43,7 @@ Give your answer modulo 108. ```yml tests: - text: euler366() should return 88351299. - testString: assert.strictEqual(euler366(), 88351299, 'euler366() should return 88351299.'); + testString: assert.strictEqual(euler366(), 88351299); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-367-bozo-sort.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-367-bozo-sort.english.md index ad914793d9..ce5e98b46d 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-367-bozo-sort.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-367-bozo-sort.english.md @@ -36,7 +36,7 @@ Give your answer rounded to the nearest integer. ```yml tests: - text: euler367() should return 48271207. - testString: assert.strictEqual(euler367(), 48271207, 'euler367() should return 48271207.'); + testString: assert.strictEqual(euler367(), 48271207); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.english.md index 0b0764255e..76fee2c4fa 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.english.md @@ -33,7 +33,7 @@ Give your answer rounded to 10 digits behind the decimal point. ```yml tests: - text: euler368() should return 253.6135092068. - testString: assert.strictEqual(euler368(), 253.6135092068, 'euler368() should return 253.6135092068.'); + testString: assert.strictEqual(euler368(), 253.6135092068); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-369-badugi.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-369-badugi.english.md index 9e64c4fd9b..7f62faca4e 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-369-badugi.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-369-badugi.english.md @@ -24,7 +24,7 @@ Find ∑f(n) for 4 ≤ n ≤ 13. ```yml tests: - text: euler369() should return 862400558448. - testString: assert.strictEqual(euler369(), 862400558448, 'euler369() should return 862400558448.'); + testString: assert.strictEqual(euler369(), 862400558448); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-37-truncatable-primes.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-37-truncatable-primes.english.md index b1d6ef616c..95d32e7732 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-37-truncatable-primes.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-37-truncatable-primes.english.md @@ -22,13 +22,13 @@ NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes. ```yml tests: - text: truncatablePrimes(8) should return 1986. - testString: assert(truncatablePrimes(8) == 1986, 'truncatablePrimes(8) should return 1986.'); + testString: assert(truncatablePrimes(8) == 1986); - text: truncatablePrimes(9) should return 5123. - testString: assert(truncatablePrimes(9) == 5123, 'truncatablePrimes(9) should return 5123.'); + testString: assert(truncatablePrimes(9) == 5123); - text: truncatablePrimes(10) should return 8920. - testString: assert(truncatablePrimes(10) == 8920, 'truncatablePrimes(10) should return 8920.'); + testString: assert(truncatablePrimes(10) == 8920); - text: truncatablePrimes(11) should return 748317. - testString: assert(truncatablePrimes(11) == 748317, 'truncatablePrimes(11) should return 748317.'); + testString: assert(truncatablePrimes(11) == 748317); ``` diff --git a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-370-geometric-triangles.english.md b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-370-geometric-triangles.english.md index 2e6b6c72ed..845aa31c7c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-370-geometric-triangles.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-370-geometric-triangles.english.md @@ -26,7 +26,7 @@ How many geometric triangles exist with perimeter ≤ 2.5·1013 ? ```yml tests: - text: euler370() should return 41791929448408. - testString: assert.strictEqual(euler370(), 41791929448408, 'euler370() should return 41791929448408.'); + testString: assert.strictEqual(euler370(), 41791929448408); ```