Given A and B, count the numbers N such that A ≤ N ≤ B and N is a palindrome.
Merge branch 'master' of https://github.com/sureshsajja/CodeRevisited