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

896 B

id title challengeType forumTopicId dashedName
5900f3a41000cf542c50feb7 Problem 56: Powerful digit sum 5 302167 problem-56-powerful-digit-sum

--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?

--hints--

powerfulDigitSum() should return a number.

assert(typeof powerfulDigitSum() === 'number');

powerfulDigitSum() should return 972.

assert.strictEqual(powerfulDigitSum(), 972);

--seed--

--seed-contents--

function powerfulDigitSum() {

  return true;
}

powerfulDigitSum();

--solutions--

// solution required