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.2 KiB
1.2 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3a41000cf542c50feb7 | 5 | Problem 56: Powerful digit sum | 302167 |
Description
A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, ab, where a, b < 100, what is the maximum digital sum?
Instructions
Tests
tests:
- text: <code>powerfulDigitSum()</code> should return a number.
testString: assert(typeof powerfulDigitSum() === 'number');
- text: <code>powerfulDigitSum()</code> should return 972.
testString: assert.strictEqual(powerfulDigitSum(), 972);
Challenge Seed
function powerfulDigitSum() {
// Good luck!
return true;
}
powerfulDigitSum();
Solution
// solution required