greatbody
/
freeCodeCamp
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

feat(euler-problem): Add test and solution for project euler problem 6 (#15987)

pull/18182/head
Aung Myo Kyaw 2017-10-26 08:10:10 +06:30 committed by Alvin Kristanto
parent 9d6453d985
commit 591b7bf0f4
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
View File

@ -140,17 +140,21 @@
"type": "bonfire", "type": "bonfire",
"title": "Problem 6: Sum square difference", "title": "Problem 6: Sum square difference",
"tests": [ "tests": [
"assert.strictEqual(euler6(), 25164150, 'message: <code>euler6()</code> should return 25164150.');" "assert.strictEqual(sumSquareDifference(10), 2640, 'message: <code>sumSquareDifference(10)</code> should return 2640.');",
"assert.strictEqual(sumSquareDifference(20), 41230, 'message: <code>sumSquareDifference(20)</code> should return 41230.');",
"assert.strictEqual(sumSquareDifference(100), 25164150, 'message: <code>sumSquareDifference(100)</code> should return 25164150.');"
],
"solutions": [
"const sumSquareDifference = (number)=>{\n let squareOfSum = Math.pow(sumOfArithmeticSeries(1,1,number),2);\n let sumOfSquare = sumOfSquareOfNumbers(number);\n return squareOfSum - sumOfSquare;\n}\n\nfunction sumOfArithmeticSeries(a,d,n){\n return (n/2)*(2*a+(n-1)*d);\n}\n\nfunction sumOfSquareOfNumbers(n){\n return (n*(n+1)*(2*n+1))/6;\n}"
], ],
"solutions": [],
"translations": {}, "translations": {},
"challengeSeed": [ "challengeSeed": [
"function euler6() {", "function sumSquareDifference(number) {",
" // Good luck!", " // Good luck!",
" return true;", " return true;",
"}", "}",
"", "",
"euler6();" "sumSquareDifference(100);"
], ],
"description": [ "description": [
"The sum of the squares of the first ten natural numbers is,", "The sum of the squares of the first ten natural numbers is,",