I took an online test which was pretty easy and then I took the phone interview. I had a friend who had taken the phone interview a few weeks before me and the questions they asked him were pretty easy. They asked me pretty basic questions in the beginning and then asked me a difficult question. They asked me, what is the best way to find the duplicates within two intersecting linked list. The answer I gave was very inefficient so they gave me hints but I was really nervous and I wasn't able to figure it out. I havent heard from them yet so I doubt I will get accepted for the in-house interview.
Interview questions [1]
Question 1
what is the best way to find the duplicates within two intersecting linked list?
I interviewed at Bloomberg (New York, NY) in Oct 2012
Interview
On campus interview on Oct. 10th 2012. Two people, very nice , ask me some general algorithms. Such as how to reverse the linked list, and write the atoi function. But I did not perform well.