Yahoo

3 Rounds onsite - Communications team 1. a. Kth largest element in array - I used quicksort but discussed all possibilities before writing on the whiteboard. b. Find if a graph was connected or not - Used DFS and checked for visited nodes.

Two rounds of phone interviews. The first is about basic algorithms and data structures questions. The second round is related to C++ and parallel programming, which is not easy for a fresh graduate student.

I applied through the university job fair and they scheduled a phone interview with me after two weeks. Yahoo's interview process is kind of slow; you have to push them all the time, otherwise you have to wait. The interview was about one hour, and