freeCodeCamp

1.7 KiB

Raw Blame History

id	challengeType	title	videoUrl	localeTitle
5900f3901000cf542c50fea3	5	Problem 36: Double-base palindromes		Problema 36: Palíndromos de base dupla

Description

O número decimal, 585 = 10010010012 (binário), é palíndromo em ambas as bases. Encontre a soma de todos os números, menor que n, enquanto 1000 <= n <= 1000000, que são palíndromos na base 10 e na base 2. (Observe que o número palíndromo, em qualquer base, pode não incluir zeros à esquerda).

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

1.7 KiB Raw Blame History