6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.1 KiB
1.1 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f38e1000cf542c50fea1 | 5 | Problem 34: Digit factorials | 301998 |
Description
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
Find the numbers and the sum of the numbers which are equal to the sum of the factorial of their digits.
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
Instructions
Tests
tests:
- text: <code>digitFactorial()</code> should return an object.
testString: assert.typeOf(digitFactorial(), 'object');
- text: |
<code>digitFactorial()</code> should return { sum: 40730, numbers: [145, 40585] }.
testString: |
assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
Challenge Seed
function digitFactorial() {
// Good luck!
var sum = 0;
var numbers = [];
return { sum, numbers };
}
digitFactorial();
Solution
// solution required