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.
[AMAZON] Vertical sum of nodes
Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
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());
}