ga-wdi-boston / js-euler-palindrome-challenge Goto Github PK

http://www.mathblog.dk/project-euler-36-palindromic-base-10-2/

Grab the latest requirements, including grunt test, and place them in this repo's requirements section.

I think the bonus should be to take an array of bases and a max and return all of the numbers up to the max that are palindromes in all of the bases in the bases array and the sum (see my version).

If you just ask people to find a number that fits that characteristic for 2,8,10, they can just say "1". and be done.

The first test passes for numbers under 25. The 2nd test for numbers under 1 million does not pass. When I invoke doubleBasePalindromeSum(2, 10, 1000000) in node, I get the result that the test expects which is 872187.

Test Error:

Double base palindromes
Bases 2 and 10 for numbers less than 10
✓ returns 25
Bases 2 and 10 for numbers less than 1,000,000
1) returns 872187

1 passing (2s)
1 failing

1. Double base palindromes Bases 2 and 10 for numbers less than 1,000,000 returns 872187:
   Error: Timeout of 2000ms exceeded. For async tests and hooks, ensure "done()" is called; if returning a Promise, ensure it resolves.

Warning: Use --force to continue.

Aborted due to warnings.

"Eueler"
"10010010012 (binary)"

Change "A pull request is note required" to "A pull request is not required"