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.5 KiB
1.5 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3901000cf542c50fea3 | 5 | Problem 36: Double-base palindromes | 302020 |
Description
The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.
Find the sum of all numbers, less than n, whereas 1000 ≤ n ≤ 1000000, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)
Instructions
Tests
tests:
- text: <code>doubleBasePalindromes(1000)</code> should return a number.
testString: assert(typeof doubleBasePalindromes(1000) === 'number');
- text: <code>doubleBasePalindromes(1000)</code> should return 1772.
testString: assert(doubleBasePalindromes(1000) == 1772);
- text: <code>doubleBasePalindromes(50000)</code> should return 105795.
testString: assert(doubleBasePalindromes(50000) == 105795);
- text: <code>doubleBasePalindromes(500000)</code> should return 286602.
testString: assert(doubleBasePalindromes(500000) == 286602);
- text: <code>doubleBasePalindromes(1000000)</code> should return 872187.
testString: assert(doubleBasePalindromes(1000000) == 872187);
Challenge Seed
function doubleBasePalindromes(n) {
// Good luck!
return n;
}
doubleBasePalindromes(1000000);
Solution
// solution required