freeCodeCamp/curriculum/challenges/arabic/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.arabic.md

id	challengeType	title	videoUrl	localeTitle
5900f40c1000cf542c50ff1e	5	Problem 159: Digital root sums of factorisations

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(euler159(), 14489159, "<code>euler159()</code> should return 14489159.");'

Challenge Seed

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

euler159();

Solution

// solution required