CareerCup's 'Ace the Interview' Guide

How do you guys plan to sort an array of characters?

You idiot Ganga Narayana .. go and drown yourself in Ganga.. Is this Bubble Sort Idiot!!

This is not Bubble sort. In bubble sort you compare consecutive elements. LOLer has made that clear in above posts. Why do you have to do it again and again. Felt like killing you !!

void BubbleSorting(struct node * headStart)
{
struct node * current = headStart;
struct node * nextPtr = headStart;
int tempValue = 0;

if (headStart == NULL || headStart->next == NULL)
return;

while (current != NULL)
{
for (nextPtr = current; nextPtr != NULL; nextPtr = nextPtr->next)
{
if (current->value > nextPtr->value)
{
//swap values
tempValue = current->value;
current->value = nextPtr->value;
nextPtr->value = tempValue;
}
}
current = current ->next;
}
}

Yes hashing is efficient solution with extra storage it can be done in O(n).
Another method would be to sort the numbers in increasing order and then check if a duplicate exists. Complexity: O(nlgn)

This can be done using a hashtable. For each number, check if (value - array[i]) exists in the hash, if not then add array[i] in the hashtable. Keep going through the array, until you find the pair which adds up to the value given. For example: if value = 20 and array is: 2, 15, 8, 10, 18. Start from 2, (20-2)=18, Check is 18 exists in the hashtable, if no, then put(2) into the hashtable. Go to 15, then 8, then 10 and then finally when you come to 18, check (20-18) = 2 exists, it does,return 2 and 18. This can be done in O(n) with extra storage.

the duck can never escape. The answer of "anonymous" is right with only a little typo at the end (i.e., pi/4<1).

Incorrect. As raghava mentioned, structs default to public member access, whereas classes default to private member access. This is the ONLY difference in C++, so you can do anything with a struct that you can do with a class (constructor/destructor, inheritance, operator overloading, etc)

c++ does not have interface
c++ is not platform independent
c++ does not support multithreading

I am not that familiar with writing complex sql queries,

but

1) Recursive queries?
2) select from another select?

When we have the 'top' command, which is highly likely to have been optimized by the Database, why does one have to go and try to come up with silly queries which are likely to be inefficient?

Correctness is not the only virtue...

select * from emp_tab where ( select count(*) from emp_tab st where st.sal < emp_tab.sal ) <= n ; ( here n is 2 )