1.7 KiB
1.7 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3901000cf542c50fea3 | 5 | Problem 36: Double-base palindromes | Problema 36: Palíndromos de base dupla |
Description
Instructions
Tests
tests:
- text: <code>doubleBasePalindromes(1000)</code> deve retornar 1772.
testString: 'assert(doubleBasePalindromes(1000) == 1772, "<code>doubleBasePalindromes(1000)</code> should return 1772.");'
- text: <code>doubleBasePalindromes(50000)</code> deve retornar 105795.
testString: 'assert(doubleBasePalindromes(50000) == 105795, "<code>doubleBasePalindromes(50000)</code> should return 105795.");'
- text: <code>doubleBasePalindromes(500000)</code> deve retornar 286602.
testString: 'assert(doubleBasePalindromes(500000) == 286602, "<code>doubleBasePalindromes(500000)</code> should return 286602.");'
- text: <code>doubleBasePalindromes(1000000)</code> deve retornar 872187.
testString: 'assert(doubleBasePalindromes(1000000) == 872187, "<code>doubleBasePalindromes(1000000)</code> should return 872187.");'
Challenge Seed
function doubleBasePalindromes(n) {
// Good luck!
return n;
}
doubleBasePalindromes(1000000);
Solution
// solution required