freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.en.md

id, challengeType, title

id	challengeType	title
5900f3a41000cf542c50feb7	5	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?

Instructions

Tests

- text: <code>euler56()</code> should return 972.
  testString: 'assert.strictEqual(euler56(), 972, ''<code>euler56()</code> should return 972.'');'

Challenge Seed

function euler56() {
  // Good luck!
  return true;
}

euler56();

Solution

// solution required