Palindrome Number (Recursion)
Problem Statement
Given a number N, you need to check whether the given number is Palindrome or not. A number is said to be Palindrome when it reads the same from backward as forward.
static boolean isPalindrome(int N)
{int divisor = 1;
while (N / divisor >= 10)
divisor *= 10;
while (N != 0)
{
int leading = N / divisor;
int trailing = N % 10;
if (leading != trailing)
return false;
N= (N % divisor) / 10;
divisor = divisor / 100;
}
return true;}
