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

perf(challenges): Remove Multiple Calls to Challenge Function in Project Euler Problems (#16733) 

Removed multiple calls to the challenge function in Project Euler
problems 11 and 14. Also adjusted the spacing of the tests array for
problem 23 to make it consistent with the rest of the file.

BREAKING CHANGE: None
pull/16370/head^2
Kristofer Koishigawa 2018-02-26 21:40:09 +09:00 committed by Stuart Taylor
parent 0d820a95c1
commit 11df3f3b0d
1 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -350,7 +350,6 @@
" [7, 97, 57, 32, 16]",
"];",
"",
"largestGridProduct(grid);",
"largestGridProduct(testGrid);"
],
"description": [
@ -673,9 +672,7 @@
" return true;",
"}",
"",
"longestCollatzSequence(14);",
"longestCollatzSequence(5847);",
"longestCollatzSequence(1000000);"
"longestCollatzSequence(14);"
],
"description": [
"The following iterative sequence is defined for the set of positive integers:",
@ -938,9 +935,9 @@
"title": "Problem 23: Non-abundant sums",
"tests": [
"assert(sumOfNonAbundantNumbers(10000) === 3731004, 'message: <code>sumOfNonAbundantNumbers(10000)</code> should return 3731004.');",
"assert(sumOfNonAbundantNumbers(15000) === 4039939, 'message: <code>sumOfNonAbundantNumbers(15000)</code> should return 4039939.');",
"assert(sumOfNonAbundantNumbers(20000) === 4159710, 'message: <code>sumOfNonAbundantNumbers(20000)</code> should return 4159710.');",
"assert(sumOfNonAbundantNumbers(28123) === 4179871, 'message: <code>sumOfNonAbundantNumbers(28123)</code> should return 4179871.');"
"assert(sumOfNonAbundantNumbers(15000) === 4039939, 'message: <code>sumOfNonAbundantNumbers(15000)</code> should return 4039939.');",
"assert(sumOfNonAbundantNumbers(20000) === 4159710, 'message: <code>sumOfNonAbundantNumbers(20000)</code> should return 4159710.');",
"assert(sumOfNonAbundantNumbers(28123) === 4179871, 'message: <code>sumOfNonAbundantNumbers(28123)</code> should return 4179871.');"
],
"solutions": [],
"translations": {},