Skip to content
This repository was archived by the owner on Sep 25, 2019. It is now read-only.

Commit c2728ea

Browse files
williamsbQuincyLarson
authored andcommitted
refactor(challenges): Remove euler problem (#15837)
BREAKING CHANGE: Remove euler problem 22 from the file Closes #15831
1 parent 9b7ba0e commit c2728ea

File tree

1 file changed

+0
-24
lines changed

1 file changed

+0
-24
lines changed

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

Lines changed: 0 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -701,30 +701,6 @@
701701
"Evaluate the sum of all the amicable numbers under n."
702702
]
703703
},
704-
{
705-
"_id": "5900f3831000cf542c50fe95",
706-
"challengeType": 5,
707-
"type": "bonfire",
708-
"title": "Problem 22: Names scores",
709-
"tests": [
710-
"assert.strictEqual(euler22(), 871198282, 'message: <code>euler22()</code> should return 871198282.');"
711-
],
712-
"solutions": [],
713-
"translations": {},
714-
"challengeSeed": [
715-
"function euler22() {",
716-
" // Good luck!",
717-
" return true;",
718-
"}",
719-
"",
720-
"euler22();"
721-
],
722-
"description": [
723-
"Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.",
724-
"For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 × 53 = 49714.",
725-
"What is the total of all the name scores in the file?"
726-
]
727-
},
728704
{
729705
"_id": "5900f3831000cf542c50fe96",
730706
"challengeType": 5,

0 commit comments

Comments
 (0)