CareerCup

with O(1) time! is this even possible??
Do u mean something like a hashmap where u give the key and get the value? The best searching takes o(logn) time atleast as far as I know.

No extra space and O(1) time is possible if you are already given a hash map to search in or if the list has 0 or just 1 element!!

perfect hash table?

this question is unclear. searching what from what type of structure?

To psp.reachable@gmail.com,
The question is really a BS. I dont think Amazon asks such kind of fcuking questions. I tried to reach you on your gmail, to discuss this question further, but it seems you are completely _unreachable_ though your mailid says you are _reachable_. This really sucks man, please dont post such kinda of stupid questions.

lol.. unless you are given the element and asked to return it back..

int search(int s)
{
return s;
}

:D :D