Number is palindrome or not
Determine whether a number is palindrome or not without using extra space. Don't forget to mention whether your Algo will work for negative numbers or not.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
bool IsPalindrome(int x){
ReplyDeleteint temp,newval=0,i=0;
if(x<0){
temp=x;
while(x<0){
x=x/10;
i=i*10+9;
}
x=i+temp;
}
temp =x;i=1;
while(temp>0)
{
newval= newval*i+(temp%10);
i=10;
temp=temp/10;
}
return (x==newval);
}
//without using extra space , it doesn't work for negative numbers
ReplyDeleteboolean isPalindrome(String s){
return s.equals(new StringBuffer(s).reverse().toString());
}