1.6 KiB
1.6 KiB
id | challengeType | title |
---|---|---|
5900f38a1000cf542c50fe9d | 5 | Problem 30: Digit n powers |
Description
Instructions
Tests
tests:
- text: <code>digitnPowers(2)</code> should return 0.
testString: assert(digitnPowers(2) == 0, '<code>digitnPowers(2)</code> should return 0.');
- text: <code>digitnPowers(3)</code> should return 1301.
testString: assert(digitnPowers(3) == 1301, '<code>digitnPowers(3)</code> should return 1301.');
- text: <code>digitnPowers(4)</code> should return 19316.
testString: assert(digitnPowers(4) == 19316, '<code>digitnPowers(4)</code> should return 19316.');
- text: <code>digitnPowers(5)</code> should return 443839.
testString: assert(digitnPowers(5) == 443839, '<code>digitnPowers(5)</code> should return 443839.');
Challenge Seed
function digitnPowers(n) {
// Good luck!
return n;
}
digitnPowers(5);
Solution
// solution required