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.
//without using extra space , it doesn't work for negative numbers boolean isPalindrome(String s){ return s.equals(new StringBuffer(s).reverse().toString());
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
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());
}