freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-56-powerful-digit-s...

59 lines
950 B
Markdown

---
id: 5900f3a41000cf542c50feb7
challengeType: 5
title: 'Problem 56: Powerful digit sum'
forumTopicId: 302167
---
## Description
<section id='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?
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler56()</code> should return 972.
testString: assert.strictEqual(euler56(), 972);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler56() {
// Good luck!
return true;
}
euler56();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>