6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.6 KiB
1.6 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f36e1000cf542c50fe80 | 5 | Problem 1: Multiples of 3 and 5 | 301722 |
Description
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below the provided parameter value number.
Instructions
Tests
tests:
- text: <code>multiplesOf3and5(10)</code> should return a number.
testString: assert(typeof multiplesOf3and5(10) === 'number');
- text: <code>multiplesOf3and5(49)</code> should return 543.
testString: assert.strictEqual(multiplesOf3and5(49), 543);
- text: <code>multiplesOf3and5(1000)</code> should return 233168.
testString: assert.strictEqual(multiplesOf3and5(1000), 233168);
- text: <code>multiplesOf3and5(8456)</code> should return 16687353.
testString: assert.strictEqual(multiplesOf3and5(8456), 16687353);
- text: <code>multiplesOf3and5(19564)</code> should return 89301183.
testString: assert.strictEqual(multiplesOf3and5(19564), 89301183);
Challenge Seed
function multiplesOf3and5(number) {
// Good luck!
return true;
}
multiplesOf3and5(1000);
Solution
const multiplesOf3and5 = (number) => {
var total = 0;
for(var i = 0; i < number; i++) {
if(i % 3 == 0 || i % 5 == 0) {
total += i;
}
}
return total;
};