gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix: removed assert msg argument-3 (#36417)

Browse Source
This commit is contained in:
Randell Dawson
2019-07-26 19:30:17 -07:00
committed by Tom
parent 399705a37a
commit 3e237f43ad
75 changed files with 101 additions and 101 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.english.md
View File

@ -27,7 +27,7 @@ Give your answer rounded to 12 places behind the decimal point.
```yml
tests:
- text: <code>euler235()</code> should return 1.002322108633.
testString: assert.strictEqual(euler235(), 1.002322108633, '<code>euler235()</code> should return 1.002322108633.');
testString: assert.strictEqual(euler235(), 1.002322108633);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-236-luxury-hampers.english.md
View File

@ -32,7 +32,7 @@ Give your answer as a fraction reduced to its lowest terms, in the form u/v.
```yml
tests:
- text: <code>euler236()</code> should return 123 / 59.
testString: assert.strictEqual(euler236(), 123 / 59, '<code>euler236()</code> should return 123 / 59.');
testString: assert.strictEqual(euler236(), 123 / 59);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.english.md
View File

@ -30,7 +30,7 @@ T(10) is 2329. What is T(1012) modulo 108?
```yml
tests:
- text: <code>euler237()</code> should return 15836928.
testString: assert.strictEqual(euler237(), 15836928, '<code>euler237()</code> should return 15836928.');
testString: assert.strictEqual(euler237(), 15836928);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-238-infinite-string-tour.english.md
View File

@ -53,7 +53,7 @@ Find ∑ p(k), for 0 < k ≤ 2·1015.
```yml
tests:
- text: <code>euler238()</code> should return 9922545104535660.
testString: assert.strictEqual(euler238(), 9922545104535660, '<code>euler238()</code> should return 9922545104535660.');
testString: assert.strictEqual(euler238(), 9922545104535660);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.english.md
View File

@ -25,7 +25,7 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc
```yml
tests:
- text: <code>euler239()</code> should return 0.001887854841.
testString: assert.strictEqual(euler239(), 0.001887854841, '<code>euler239()</code> should return 0.001887854841.');
testString: assert.strictEqual(euler239(), 0.001887854841);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.english.md
View File

@ -22,13 +22,13 @@ What is the <var>n</var>th lexicographic permutation of the digits 0, 1, 2, 3, 4
```yml
tests:
- text: <code>lexicographicPermutations(699999)</code> should return 1938246570.
testString: assert(lexicographicPermutations(699999) == 1938246570, '<code>lexicographicPermutations(699999)</code> should return 1938246570.');
testString: assert(lexicographicPermutations(699999) == 1938246570);
- text: <code>lexicographicPermutations(899999)</code> should return 2536987410.
testString: assert(lexicographicPermutations(899999) == 2536987410, '<code>lexicographicPermutations(899999)</code> should return 2536987410.');
testString: assert(lexicographicPermutations(899999) == 2536987410);
- text: <code>lexicographicPermutations(900000)</code> should return 2537014689.
testString: assert(lexicographicPermutations(900000) == 2537014689, '<code>lexicographicPermutations(900000)</code> should return 2537014689.');
testString: assert(lexicographicPermutations(900000) == 2537014689);
- text: <code>lexicographicPermutations(999999)</code> should return 2783915460.
testString: assert(lexicographicPermutations(999999) == 2783915460, '<code>lexicographicPermutations(999999)</code> should return 2783915460.');
testString: assert(lexicographicPermutations(999999) == 2783915460);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-240-top-dice.english.md
View File

@ -31,7 +31,7 @@ In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so
```yml
tests:
- text: <code>euler240()</code> should return 7448717393364182000.
testString: assert.strictEqual(euler240(), 7448717393364182000, '<code>euler240()</code> should return 7448717393364182000.');
testString: assert.strictEqual(euler240(), 7448717393364182000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-241-perfection-quotients.english.md
View File

@ -28,7 +28,7 @@ Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k +
```yml
tests:
- text: <code>euler241()</code> should return 482316491800641150.
testString: assert.strictEqual(euler241(), 482316491800641150, '<code>euler241()</code> should return 482316491800641150.');
testString: assert.strictEqual(euler241(), 482316491800641150);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-242-odd-triplets.english.md
View File

@ -28,7 +28,7 @@ How many odd-triplets are there with n ≤ 1012 ?
```yml
tests:
- text: <code>euler242()</code> should return 997104142249036700.
testString: assert.strictEqual(euler242(), 997104142249036700, '<code>euler242()</code> should return 997104142249036700.');
testString: assert.strictEqual(euler242(), 997104142249036700);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-243-resilience.english.md
View File

@ -28,7 +28,7 @@ Find the smallest denominator d, having a resilience R(d) < 15499/94744 .
```yml
tests:
- text: <code>euler243()</code> should return 892371480.
testString: assert.strictEqual(euler243(), 892371480, '<code>euler243()</code> should return 892371480.');
testString: assert.strictEqual(euler243(), 892371480);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md
View File

@ -45,7 +45,7 @@ What is the sum of all checksums for the paths having the minimal length?
```yml
tests:
- text: <code>euler244()</code> should return 96356848.
testString: assert.strictEqual(euler244(), 96356848, '<code>euler244()</code> should return 96356848.');
testString: assert.strictEqual(euler244(), 96356848);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-245-coresilience.english.md
View File

@ -30,7 +30,7 @@ Find the sum of all composite integers 1 < n ≤ 2×1011, for which C(n) is a un
```yml
tests:
- text: <code>euler245()</code> should return 288084712410001.
testString: assert.strictEqual(euler245(), 288084712410001, '<code>euler245()</code> should return 288084712410001.');
testString: assert.strictEqual(euler245(), 288084712410001);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.english.md
View File

@ -38,7 +38,7 @@ For how many lattice points P is angle RPS greater than 45 degrees?
```yml
tests:
- text: <code>euler246()</code> should return 810834388.
testString: assert.strictEqual(euler246(), 810834388, '<code>euler246()</code> should return 810834388.');
testString: assert.strictEqual(euler246(), 810834388);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.english.md
View File

@ -35,7 +35,7 @@ What is the largest n for which the index of Sn is (3,3)?
```yml
tests:
- text: <code>euler247()</code> should return 782252.
testString: assert.strictEqual(euler247(), 782252, '<code>euler247()</code> should return 782252.');
testString: assert.strictEqual(euler247(), 782252);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.english.md
View File

@ -21,7 +21,7 @@ Find the 150,000th such number.
```yml
tests:
- text: <code>euler248()</code> should return 23507044290.
testString: assert.strictEqual(euler248(), 23507044290, '<code>euler248()</code> should return 23507044290.');
testString: assert.strictEqual(euler248(), 23507044290);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-249-prime-subset-sums.english.md
View File

@ -22,7 +22,7 @@ Enter the rightmost 16 digits as your answer.
```yml
tests:
- text: <code>euler249()</code> should return 9275262564250418.
testString: assert.strictEqual(euler249(), 9275262564250418, '<code>euler249()</code> should return 9275262564250418.');
testString: assert.strictEqual(euler249(), 9275262564250418);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.english.md
View File

@ -25,13 +25,13 @@ What is the index of the first term in the Fibonacci sequence to contain <var>n<
```yml
tests:
- text: <code>digitFibonacci(5)</code> should return 21.
testString: assert.strictEqual(digitFibonacci(5), 21, '<code>digitFibonacci(5)</code> should return 21.');
testString: assert.strictEqual(digitFibonacci(5), 21);
- text: <code>digitFibonacci(10)</code> should return 45.
testString: assert.strictEqual(digitFibonacci(10), 45, '<code>digitFibonacci(10)</code> should return 45.');
testString: assert.strictEqual(digitFibonacci(10), 45);
- text: <code>digitFibonacci(15)</code> should return 69.
testString: assert.strictEqual(digitFibonacci(15), 69, '<code>digitFibonacci(15)</code> should return 69.');
testString: assert.strictEqual(digitFibonacci(15), 69);
- text: <code>digitFibonacci(20)</code> should return 93.
testString: assert.strictEqual(digitFibonacci(20), 93, '<code>digitFibonacci(20)</code> should return 93.');
testString: assert.strictEqual(digitFibonacci(20), 93);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-250-250250.english.md
View File

@ -20,7 +20,7 @@ Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum
```yml
tests:
- text: <code>euler250()</code> should return 1425480602091519.
testString: assert.strictEqual(euler250(), 1425480602091519, '<code>euler250()</code> should return 1425480602091519.');
testString: assert.strictEqual(euler250(), 1425480602091519);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md
View File

@ -30,7 +30,7 @@ Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.
```yml
tests:
- text: <code>euler251()</code> should return 18946051.
testString: assert.strictEqual(euler251(), 18946051, '<code>euler251()</code> should return 18946051.');
testString: assert.strictEqual(euler251(), 18946051);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-252-convex-holes.english.md
View File

@ -46,7 +46,7 @@ What is the maximum area for a convex hole on the set containing the first 500 p
```yml
tests:
- text: <code>euler252()</code> should return 104924.
testString: assert.strictEqual(euler252(), 104924, '<code>euler252()</code> should return 104924.');
testString: assert.strictEqual(euler252(), 104924);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-253-tidying-up.english.md
View File

@ -38,7 +38,7 @@ Give your answer rounded to six decimal places.
```yml
tests:
- text: <code>euler253()</code> should return 11.492847.
testString: assert.strictEqual(euler253(), 11.492847, '<code>euler253()</code> should return 11.492847.');
testString: assert.strictEqual(euler253(), 11.492847);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.english.md
View File

@ -30,7 +30,7 @@ What is ∑ sg(i) for 1 ≤ i ≤ 150?
```yml
tests:
- text: <code>euler254()</code> should return 8184523820510.
testString: assert.strictEqual(euler254(), 8184523820510, '<code>euler254()</code> should return 8184523820510.');
testString: assert.strictEqual(euler254(), 8184523820510);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-255-rounded-square-roots.english.md
View File

@ -43,7 +43,7 @@ Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling f
```yml
tests:
- text: <code>euler255()</code> should return 4.447401118.
testString: assert.strictEqual(euler255(), 4.447401118, '<code>euler255()</code> should return 4.447401118.');
testString: assert.strictEqual(euler255(), 4.447401118);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.english.md
View File

@ -45,7 +45,7 @@ Find the smallest room-size s for which T(s) = 200.
```yml
tests:
- text: <code>euler256()</code> should return 85765680.
testString: assert.strictEqual(euler256(), 85765680, '<code>euler256()</code> should return 85765680.');
testString: assert.strictEqual(euler256(), 85765680);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-257-angular-bisectors.english.md
View File

@ -32,7 +32,7 @@ How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area
```yml
tests:
- text: <code>euler257()</code> should return 139012411.
testString: assert.strictEqual(euler257(), 139012411, '<code>euler257()</code> should return 139012411.');
testString: assert.strictEqual(euler257(), 139012411);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
View File

@ -24,7 +24,7 @@ Find gk mod 20092010 for k = 1018.
```yml
tests:
- text: <code>euler258()</code> should return 12747994.
testString: assert.strictEqual(euler258(), 12747994, '<code>euler258()</code> should return 12747994.');
testString: assert.strictEqual(euler258(), 12747994);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-259-reachable-numbers.english.md
View File

@ -30,7 +30,7 @@ What is the sum of all positive reachable integers?
```yml
tests:
- text: <code>euler259()</code> should return 20101196798.
testString: assert.strictEqual(euler259(), 20101196798, '<code>euler259()</code> should return 20101196798.');
testString: assert.strictEqual(euler259(), 20101196798);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.english.md
View File

@ -23,13 +23,13 @@ Find the value of <var>d</var> < <var>n</var> for which <sup>1</sup>/<sub>d</sub
```yml
tests:
- text: <code>reciprocalCycles(700)</code> should return 659.
testString: assert(reciprocalCycles(700) == 659, '<code>reciprocalCycles(700)</code> should return 659.');
testString: assert(reciprocalCycles(700) == 659);
- text: <code>reciprocalCycles(800)</code> should return 743.
testString: assert(reciprocalCycles(800) == 743, '<code>reciprocalCycles(800)</code> should return 743.');
testString: assert(reciprocalCycles(800) == 743);
- text: <code>reciprocalCycles(900)</code> should return 887.
testString: assert(reciprocalCycles(900) == 887, '<code>reciprocalCycles(900)</code> should return 887.');
testString: assert(reciprocalCycles(900) == 887);
- text: <code>reciprocalCycles(1000)</code> should return 983.
testString: assert(reciprocalCycles(1000) == 983, '<code>reciprocalCycles(1000)</code> should return 983.');
testString: assert(reciprocalCycles(1000) == 983);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-260-stone-game.english.md
View File

@ -39,7 +39,7 @@ with xi ≤ yi ≤ zi ≤ 1000.
```yml
tests:
- text: <code>euler260()</code> should return 167542057.
testString: assert.strictEqual(euler260(), 167542057, '<code>euler260()</code> should return 167542057.');
testString: assert.strictEqual(euler260(), 167542057);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.english.md
View File

@ -29,7 +29,7 @@ Some small square-pivots are
```yml
tests:
- text: <code>euler261()</code> should return 238890850232021.
testString: assert.strictEqual(euler261(), 238890850232021, '<code>euler261()</code> should return 238890850232021.');
testString: assert.strictEqual(euler261(), 238890850232021);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-262-mountain-range.english.md
View File

@ -35,7 +35,7 @@ h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) ) * exp( -abs(0.000001*(x*x+y*y)-0.0015*
```yml
tests:
- text: <code>euler262()</code> should return 2531.205.
testString: assert.strictEqual(euler262(), 2531.205, '<code>euler262()</code> should return 2531.205.');
testString: assert.strictEqual(euler262(), 2531.205);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.english.md
View File

@ -39,7 +39,7 @@ Find the sum of the first four engineers’ paradises.
```yml
tests:
- text: <code>euler263()</code> should return 2039506520.
testString: assert.strictEqual(euler263(), 2039506520, '<code>euler263()</code> should return 2039506520.');
testString: assert.strictEqual(euler263(), 2039506520);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-264-triangle-centres.english.md
View File

@ -40,7 +40,7 @@ Enter as your answer the sum of their perimeters rounded to four decimal places.
```yml
tests:
- text: <code>euler264()</code> should return 2816417.1055.
testString: assert.strictEqual(euler264(), 2816417.1055, '<code>euler264()</code> should return 2816417.1055.');
testString: assert.strictEqual(euler264(), 2816417.1055);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-265-binary-circles.english.md
View File

@ -33,7 +33,7 @@ Find S(5).
```yml
tests:
- text: <code>euler265()</code> should return 209110240768.
testString: assert.strictEqual(euler265(), 209110240768, '<code>euler265()</code> should return 209110240768.');
testString: assert.strictEqual(euler265(), 209110240768);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-266-pseudo-square-root.english.md
View File

@ -27,7 +27,7 @@ Find PSR(p) mod 1016.
```yml
tests:
- text: <code>euler266()</code> should return 1096883702440585.
testString: assert.strictEqual(euler266(), 1096883702440585, '<code>euler266()</code> should return 1096883702440585.');
testString: assert.strictEqual(euler266(), 1096883702440585);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-267-billionaire.english.md
View File

@ -25,7 +25,7 @@ All computations are assumed to be exact (no rounding), but give your answer rou
```yml
tests:
- text: <code>euler267()</code> should return 0.999992836187.
testString: assert.strictEqual(euler267(), 0.999992836187, '<code>euler267()</code> should return 0.999992836187.');
testString: assert.strictEqual(euler267(), 0.999992836187);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md
View File

@ -22,7 +22,7 @@ Find how many positive integers less than 1016 are divisible by at least four di
```yml
tests:
- text: <code>euler268()</code> should return 785478606870985.
testString: assert.strictEqual(euler268(), 785478606870985, '<code>euler268()</code> should return 785478606870985.');
testString: assert.strictEqual(euler268(), 785478606870985);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.english.md
View File

@ -30,7 +30,7 @@ What is Z(1016)?
```yml
tests:
- text: <code>euler269()</code> should return 1311109198529286.
testString: assert.strictEqual(euler269(), 1311109198529286, '<code>euler269()</code> should return 1311109198529286.');
testString: assert.strictEqual(euler269(), 1311109198529286);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-27-quadratic-primes.english.md
View File

@ -28,13 +28,13 @@ Find the product of the coefficients, $a$ and $b$, for the quadratic expression
```yml
tests:
- text: <code>quadraticPrimes(200)</code> should return -4925.
testString: assert(quadraticPrimes(200) == -4925, '<code>quadraticPrimes(200)</code> should return -4925.');
testString: assert(quadraticPrimes(200) == -4925);
- text: <code>quadraticPrimes(500)</code> should return -18901.
testString: assert(quadraticPrimes(500) == -18901, '<code>quadraticPrimes(500)</code> should return -18901.');
testString: assert(quadraticPrimes(500) == -18901);
- text: <code>quadraticPrimes(800)</code> should return -43835.
testString: assert(quadraticPrimes(800) == -43835, '<code>quadraticPrimes(800)</code> should return -43835.');
testString: assert(quadraticPrimes(800) == -43835);
- text: <code>quadraticPrimes(1000)</code> should return -59231.
testString: assert(quadraticPrimes(1000) == -59231, '<code>quadraticPrimes(1000)</code> should return -59231.');
testString: assert(quadraticPrimes(1000) == -59231);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-270-cutting-squares.english.md
View File

@ -27,7 +27,7 @@ What is C(30) mod 108 ?
```yml
tests:
- text: <code>euler270()</code> should return 82282080.
testString: assert.strictEqual(euler270(), 82282080, '<code>euler270()</code> should return 82282080.');
testString: assert.strictEqual(euler270(), 82282080);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.english.md
View File

@ -26,7 +26,7 @@ Find S(13082761331670030).
```yml
tests:
- text: <code>euler271()</code> should return 4617456485273130000.
testString: assert.strictEqual(euler271(), 4617456485273130000, '<code>euler271()</code> should return 4617456485273130000.');
testString: assert.strictEqual(euler271(), 4617456485273130000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.english.md
View File

@ -26,7 +26,7 @@ Find the sum of the positive numbers n≤1011 for which C(n)=242.
```yml
tests:
- text: <code>euler272()</code> should return 8495585919506151000.
testString: assert.strictEqual(euler272(), 8495585919506151000, '<code>euler272()</code> should return 8495585919506151000.');
testString: assert.strictEqual(euler272(), 8495585919506151000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-273-sum-of-squares.english.md
View File

@ -26,7 +26,7 @@ Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 wit
```yml
tests:
- text: <code>euler273()</code> should return 2032447591196869000.
testString: assert.strictEqual(euler273(), 2032447591196869000, '<code>euler273()</code> should return 2032447591196869000.');
testString: assert.strictEqual(euler273(), 2032447591196869000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.english.md
View File

@ -32,7 +32,7 @@ The sum of the divisibility multipliers for the primes that are coprime to 10 an
```yml
tests:
- text: <code>euler274()</code> should return 1601912348822.
testString: assert.strictEqual(euler274(), 1601912348822, '<code>euler274()</code> should return 1601912348822.');
testString: assert.strictEqual(euler274(), 1601912348822);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-275-balanced-sculptures.english.md
View File

@ -28,7 +28,7 @@ There are 964 balanced sculptures of order 10 and 360505 of order 15.How many ba
```yml
tests:
- text: <code>euler275()</code> should return 15030564.
testString: assert.strictEqual(euler275(), 15030564, '<code>euler275()</code> should return 15030564.');
testString: assert.strictEqual(euler275(), 15030564);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.english.md
View File

@ -22,7 +22,7 @@ How many primitive integer sided triangles exist with a perimeter not exceeding
```yml
tests:
- text: <code>euler276()</code> should return 5777137137739633000.
testString: assert.strictEqual(euler276(), 5777137137739633000, '<code>euler276()</code> should return 5777137137739633000.');
testString: assert.strictEqual(euler276(), 5777137137739633000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.english.md
View File

@ -44,7 +44,7 @@ What is the smallest a1 > 1015 that begins with the sequence "UDDDUdddDDUDDddDdD
```yml
tests:
- text: <code>euler277()</code> should return 1125977393124310.
testString: assert.strictEqual(euler277(), 1125977393124310, '<code>euler277()</code> should return 1125977393124310.');
testString: assert.strictEqual(euler277(), 1125977393124310);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.english.md
View File

@ -30,7 +30,7 @@ Find ∑ f(p*q,p*r,q*r), where p, q and r are prime numbers and p < q < r < 5000
```yml
tests:
- text: <code>euler278()</code> should return 1228215747273908500.
testString: assert.strictEqual(euler278(), 1228215747273908500, '<code>euler278()</code> should return 1228215747273908500.');
testString: assert.strictEqual(euler278(), 1228215747273908500);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.english.md
View File

@ -20,7 +20,7 @@ How many triangles are there with integral sides, at least one integral angle (m
```yml
tests:
- text: <code>euler279()</code> should return 416577688.
testString: assert.strictEqual(euler279(), 416577688, '<code>euler279()</code> should return 416577688.');
testString: assert.strictEqual(euler279(), 416577688);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.english.md
View File

@ -27,13 +27,13 @@ What is the sum of the numbers on the diagonals in a n by n spiral formed in the
```yml
tests:
- text: <code>spiralDiagonals(101)</code> should return 692101.
testString: assert(spiralDiagonals(101) == 692101, '<code>spiralDiagonals(101)</code> should return 692101.');
testString: assert(spiralDiagonals(101) == 692101);
- text: <code>spiralDiagonals(303)</code> should return 18591725.
testString: assert(spiralDiagonals(303) == 18591725, '<code>spiralDiagonals(303)</code> should return 18591725.');
testString: assert(spiralDiagonals(303) == 18591725);
- text: <code>spiralDiagonals(505)</code> should return 85986601.
testString: assert(spiralDiagonals(505) == 85986601, '<code>spiralDiagonals(505)</code> should return 85986601.');
testString: assert(spiralDiagonals(505) == 85986601);
- text: <code>spiralDiagonals(1001)</code> should return 669171001.
testString: assert(spiralDiagonals(1001) == 669171001, '<code>spiralDiagonals(1001)</code> should return 669171001.');
testString: assert(spiralDiagonals(1001) == 669171001);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-280-ant-and-seeds.english.md
View File

@ -25,7 +25,7 @@ Give your answer rounded to 6 decimal places.
```yml
tests:
- text: <code>euler280()</code> should return 430.088247.
testString: assert.strictEqual(euler280(), 430.088247, '<code>euler280()</code> should return 430.088247.');
testString: assert.strictEqual(euler280(), 430.088247);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-281-pizza-toppings.english.md
View File

@ -28,7 +28,7 @@ Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
```yml
tests:
- text: <code>euler281()</code> should return 1485776387445623.
testString: assert.strictEqual(euler281(), 1485776387445623, '<code>euler281()</code> should return 1485776387445623.');
testString: assert.strictEqual(euler281(), 1485776387445623);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md
View File

@ -27,7 +27,7 @@ Find A(n, n) and give your answer mod 148.
```yml
tests:
- text: <code>euler282()</code> should return 1098988351.
testString: assert.strictEqual(euler282(), 1098988351, '<code>euler282()</code> should return 1098988351.');
testString: assert.strictEqual(euler282(), 1098988351);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.english.md
View File

@ -26,7 +26,7 @@ Find the sum of the perimeters of all integer sided triangles for which the area
```yml
tests:
- text: <code>euler283()</code> should return 28038042525570324.
testString: assert.strictEqual(euler283(), 28038042525570324, '<code>euler283()</code> should return 28038042525570324.');
testString: assert.strictEqual(euler283(), 28038042525570324);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-285-pythagorean-odds.english.md
View File

@ -29,7 +29,7 @@ If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, wh
```yml
tests:
- text: <code>euler285()</code> should return 157055.80999.
testString: assert.strictEqual(euler285(), 157055.80999, '<code>euler285()</code> should return 157055.80999.');
testString: assert.strictEqual(euler285(), 157055.80999);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-286-scoring-probabilities.english.md
View File

@ -24,7 +24,7 @@ Find q and give your answer rounded to 10 decimal places.
```yml
tests:
- text: <code>euler286()</code> should return 52.6494571953.
testString: assert.strictEqual(euler286(), 52.6494571953, '<code>euler286()</code> should return 52.6494571953.');
testString: assert.strictEqual(euler286(), 52.6494571953);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.english.md
View File

@ -35,7 +35,7 @@ otherwise the pixel is white.What is the length of the minimal sequence describi
```yml
tests:
- text: <code>euler287()</code> should return 313135496.
testString: assert.strictEqual(euler287(), 313135496, '<code>euler287()</code> should return 313135496.');
testString: assert.strictEqual(euler287(), 313135496);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.english.md
View File

@ -35,7 +35,7 @@ Find NF(61,107) mod 6110
```yml
tests:
- text: <code>euler288()</code> should return 605857431263982000.
testString: assert.strictEqual(euler288(), 605857431263982000, '<code>euler288()</code> should return 605857431263982000.');
testString: assert.strictEqual(euler288(), 605857431263982000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-289-eulerian-cycles.english.md
View File

@ -34,7 +34,7 @@ Find L(6,10) mod 1010.
```yml
tests:
- text: <code>euler289()</code> should return 6567944538.
testString: assert.strictEqual(euler289(), 6567944538, '<code>euler289()</code> should return 6567944538.');
testString: assert.strictEqual(euler289(), 6567944538);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-29-distinct-powers.english.md
View File

@ -27,13 +27,13 @@ How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ n an
```yml
tests:
- text: <code>distinctPowers(15)</code> should return 177.
testString: assert.strictEqual(distinctPowers(15), 177, '<code>distinctPowers(15)</code> should return 177.');
testString: assert.strictEqual(distinctPowers(15), 177);
- text: <code>distinctPowers(20)</code> should return 324.
testString: assert.strictEqual(distinctPowers(20), 324, '<code>distinctPowers(20)</code> should return 324.');
testString: assert.strictEqual(distinctPowers(20), 324);
- text: <code>distinctPowers(25)</code> should return 519.
testString: assert.strictEqual(distinctPowers(25), 519, '<code>distinctPowers(25)</code> should return 519.');
testString: assert.strictEqual(distinctPowers(25), 519);
- text: <code>distinctPowers(30)</code> should return 755.
testString: assert.strictEqual(distinctPowers(30), 755, '<code>distinctPowers(30)</code> should return 755.');
testString: assert.strictEqual(distinctPowers(30), 755);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-290-digital-signature.english.md
View File

@ -20,7 +20,7 @@ How many integers 0 ≤ n < 1018 have the property that the sum of the digits of
```yml
tests:
- text: <code>euler290()</code> should return 20444710234716470.
testString: assert.strictEqual(euler290(), 20444710234716470, '<code>euler290()</code> should return 20444710234716470.');
testString: assert.strictEqual(euler290(), 20444710234716470);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
View File

@ -23,7 +23,7 @@ Find how many Panaitopol primes are less than 5×1015.
```yml
tests:
- text: <code>euler291()</code> should return 4037526.
testString: assert.strictEqual(euler291(), 4037526, '<code>euler291()</code> should return 4037526.');
testString: assert.strictEqual(euler291(), 4037526);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.english.md
View File

@ -27,7 +27,7 @@ Find P(120).
```yml
tests:
- text: <code>euler292()</code> should return 3600060866.
testString: assert.strictEqual(euler292(), 3600060866, '<code>euler292()</code> should return 3600060866.');
testString: assert.strictEqual(euler292(), 3600060866);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.english.md
View File

@ -32,7 +32,7 @@ Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N l
```yml
tests:
- text: <code>euler293()</code> should return 2209.
testString: assert.strictEqual(euler293(), 2209, '<code>euler293()</code> should return 2209.');
testString: assert.strictEqual(euler293(), 2209);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.english.md
View File

@ -31,7 +31,7 @@ Find S(1112) and give your answer mod 109.
```yml
tests:
- text: <code>euler294()</code> should return 789184709.
testString: assert.strictEqual(euler294(), 789184709, '<code>euler294()</code> should return 789184709.');
testString: assert.strictEqual(euler294(), 789184709);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-295-lenticular-holes.english.md
View File

@ -42,7 +42,7 @@ Find L(100 000).
```yml
tests:
- text: <code>euler295()</code> should return 4884650818.
testString: assert.strictEqual(euler295(), 4884650818, '<code>euler295()</code> should return 4884650818.');
testString: assert.strictEqual(euler295(), 4884650818);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.english.md
View File

@ -25,7 +25,7 @@ How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE
```yml
tests:
- text: <code>euler296()</code> should return 1137208419.
testString: assert.strictEqual(euler296(), 1137208419, '<code>euler296()</code> should return 1137208419.');
testString: assert.strictEqual(euler296(), 1137208419);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.english.md
View File

@ -30,7 +30,7 @@ Find ∑ z(n) for 0<n<1017.
```yml
tests:
- text: <code>euler297()</code> should return 2252639041804718000.
testString: assert.strictEqual(euler297(), 2252639041804718000, '<code>euler297()</code> should return 2252639041804718000.');
testString: assert.strictEqual(euler297(), 2252639041804718000);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-298-selective-amnesia.english.md
View File

@ -94,7 +94,7 @@ Denoting Larry's score by L and Robin's score by R, what is the expected value o
```yml
tests:
- text: <code>euler298()</code> should return 1.76882294.
testString: assert.strictEqual(euler298(), 1.76882294, '<code>euler298()</code> should return 1.76882294.');
testString: assert.strictEqual(euler298(), 1.76882294);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-299-three-similar-triangles.english.md
View File

@ -33,7 +33,7 @@ If b+d < 100 000 000, how many distinct triplets (a,b,d) are there such that p
```yml
tests:
- text: <code>euler299()</code> should return 549936643.
testString: assert.strictEqual(euler299(), 549936643, '<code>euler299()</code> should return 549936643.');
testString: assert.strictEqual(euler299(), 549936643);
```

12
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.english.md
View File

@ -21,17 +21,17 @@ What is the largest prime factor of the given <code>number</code>?
```yml
tests:
- text: <code>largestPrimeFactor(2)</code> should return 2.
testString: assert.strictEqual(largestPrimeFactor(2), 2, '<code>largestPrimeFactor(2)</code> should return 2.');
testString: assert.strictEqual(largestPrimeFactor(2), 2);
- text: <code>largestPrimeFactor(3)</code> should return 3.
testString: assert.strictEqual(largestPrimeFactor(3), 3, '<code>largestPrimeFactor(3)</code> should return 3.');
testString: assert.strictEqual(largestPrimeFactor(3), 3);
- text: <code>largestPrimeFactor(5)</code> should return 5.
testString: assert.strictEqual(largestPrimeFactor(5), 5, '<code>largestPrimeFactor(5)</code> should return 5.');
testString: assert.strictEqual(largestPrimeFactor(5), 5);
- text: <code>largestPrimeFactor(7)</code> should return 7.
testString: assert.strictEqual(largestPrimeFactor(7), 7, '<code>largestPrimeFactor(7)</code> should return 7.');
testString: assert.strictEqual(largestPrimeFactor(7), 7);
- text: <code>largestPrimeFactor(13195)</code> should return 29.
testString: assert.strictEqual(largestPrimeFactor(13195), 29, '<code>largestPrimeFactor(13195)</code> should return 29.');
testString: assert.strictEqual(largestPrimeFactor(13195), 29);
- text: <code>largestPrimeFactor(600851475143)</code> should return 6857.
testString: assert.strictEqual(largestPrimeFactor(600851475143), 6857, '<code>largestPrimeFactor(600851475143)</code> should return 6857.');
testString: assert.strictEqual(largestPrimeFactor(600851475143), 6857);
```

8
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-30-digit-n-powers.english.md
View File

@ -26,13 +26,13 @@ Find the sum of all the numbers that can be written as the sum of n powers of th
```yml
tests:
- text: <code>digitnPowers(2)</code> should return 0.
testString: assert(digitnPowers(2) == 0, '<code>digitnPowers(2)</code> should return 0.');
testString: assert(digitnPowers(2) == 0);
- text: <code>digitnPowers(3)</code> should return 1301.
testString: assert(digitnPowers(3) == 1301, '<code>digitnPowers(3)</code> should return 1301.');
testString: assert(digitnPowers(3) == 1301);
- text: <code>digitnPowers(4)</code> should return 19316.
testString: assert(digitnPowers(4) == 19316, '<code>digitnPowers(4)</code> should return 19316.');
testString: assert(digitnPowers(4) == 19316);
- text: <code>digitnPowers(5)</code> should return 443839.
testString: assert(digitnPowers(5) == 443839, '<code>digitnPowers(5)</code> should return 443839.');
testString: assert(digitnPowers(5) == 443839);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-300-protein-folding.english.md
View File

@ -37,7 +37,7 @@ Give your answer using as many decimal places as necessary for an exact result.
```yml
tests:
- text: <code>euler300()</code> should return 8.0540771484375.
testString: assert.strictEqual(euler300(), 8.0540771484375, '<code>euler300()</code> should return 8.0540771484375.');
testString: assert.strictEqual(euler300(), 8.0540771484375);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-301-nim.english.md
View File

@ -36,7 +36,7 @@ For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?
```yml
tests:
- text: <code>euler301()</code> should return 2178309.
testString: assert.strictEqual(euler301(), 2178309, '<code>euler301()</code> should return 2178309.');
testString: assert.strictEqual(euler301(), 2178309);
```

2
curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.english.md
View File

@ -38,7 +38,7 @@ How many Strong Achilles numbers are there below 1018?
```yml
tests:
- text: <code>euler302()</code> should return 1170060.
testString: assert.strictEqual(euler302(), 1170060, '<code>euler302()</code> should return 1170060.');
testString: assert.strictEqual(euler302(), 1170060);
```