1.9 KiB
1.9 KiB
title | id | challengeType | forumTopicId |
---|---|---|---|
100 doors | 594810f028c0303b75339acb | 5 | 302217 |
Description
Instructions
Tests
tests:
- text: <code>getFinalOpenedDoors</code> should be a function.
testString: assert(typeof getFinalOpenedDoors === 'function');
- text: <code>getFinalOpenedDoors</code> should return an array.
testString: assert(Array.isArray(getFinalOpenedDoors(100)));
- text: <code>getFinalOpenedDoors</code> should produce the correct result.
testString: assert.deepEqual(getFinalOpenedDoors(100), solution);
Challenge Seed
function getFinalOpenedDoors(numDoors) {
}
After Test
const solution = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100];
Solution
function getFinalOpenedDoors(numDoors) {
// this is the final pattern (always squares).
// thus, the most efficient solution simply returns an array of squares up to numDoors).
const finalState = [];
let i = 1;
while (Math.pow(i, 2) <= numDoors) {
finalState.push(Math.pow(i, 2));
i++;
}
return finalState;
}