freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-16-power-digit-sum....

60 lines
1.3 KiB
Markdown

---
id: 5900f37d1000cf542c50fe8f
challengeType: 5
title: 'Problem 16: Power digit sum'
videoUrl: ''
localeTitle: 'Problema 16: suma de dígitos de potencia'
---
## Description
<section id="description"> 2 <sup>15</sup> = 32768 y la suma de sus dígitos es 3 + 2 + 7 + 6 + 8 = 26. ¿Cuál es la suma de los dígitos del <sup><code>exponent</code></sup> número 2? </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>powerDigitSum(15)</code> debe devolver 26.
testString: 'assert.strictEqual(powerDigitSum(15), 26, "<code>powerDigitSum(15)</code> should return 26.");'
- text: <code>powerDigitSum(128)</code> debe devolver 166.
testString: 'assert.strictEqual(powerDigitSum(128), 166, "<code>powerDigitSum(128)</code> should return 166.");'
- text: <code>powerDigitSum(1000)</code> debe devolver 1366.
testString: 'assert.strictEqual(powerDigitSum(1000), 1366, "<code>powerDigitSum(1000)</code> should return 1366.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function powerDigitSum(exponent) {
// Good luck!
return true;
}
powerDigitSum(15);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>