* Update finders-keepers.english.md A better approach to finder's keepers problem * A better appoach to solve finders-keepers (JS) Fixed travis bug * fix: indented solution code
1.7 KiB
1.7 KiB
id, title, isRequired, challengeType
id | title | isRequired | challengeType |
---|---|---|---|
a6e40f1041b06c996f7b2406 | Finders Keepers | true | 5 |
Description
Instructions
Tests
tests:
- text: <code>findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; })</code> should return 8.
testString: assert.strictEqual(findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; }), 8, '<code>findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; })</code> should return 8.');
- text: <code>findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; })</code> should return undefined.
testString: assert.strictEqual(findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; }), undefined, '<code>findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; })</code> should return undefined.');
Challenge Seed
function findElement(arr, func) {
let num = 0;
return num;
}
findElement([1, 2, 3, 4], num => num % 2 === 0);
Solution
function findElement(arr, func) {
return arr.filter(func)[0];
}
findElement([1, 2, 3, 4], num => num % 2 === 0);