In this challenge, you will complete Project Euler #36. Project Eueler is a collection of math problems that can be solved in many programming languages. It's a useful website for practicing whiteboarding, or for mastering the basics of the progrmaming languages you know or want to learn.
- ga-wdi-boston/js-array-methods
- ga-wdi-boston/js-array-methods-diagnostic
- "Counting in Binary" from Wikipedia
- Fork and clone this repository.
- Change into the new directory.
- Install dependencies.
- Create and checkout a new branch to work on.
- Fulfill the listed requirements.
Work in lib/challenge.js. A pull request is note required,
but it is necessary if you want a code review.
You may wish to refer to FAQs related to forking, cloning.
The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)
– from Problem 36 - Project Euler
You should be running grunt nag before diagnosing any bugs, since it finds
some of the most common sources of errors.
Find a palindrome in three bases: decimal, binary, and octal.
Source code distributed under the MIT license. Text and other assets copyright General Assembly, Inc., all rights reserved.