Round 1: A recruiter calls you. They will ask a few simple questions, such as "What's faster, Quicksort or Bubblesort?" If you answer enough of these correctly, you proceed to the next round. If you fail here, stop moaning, go away, and improve yourself. There's no way you would have passed the later stages anyway.

Round 2: An engineer will call you and interview you for 45 minutes. Only the "best" interviewers get to conduct what we call "first phone screens," because that's where the most people get eliminated.

Round 3: Exactly the same as Round 2, but with a different engineer. From the interviewer's perspective, second phone screens are infinitely better than first phone screens because the totally incompetent have been weeded out already.

Round 4: Onsite interviews! You will have 3 interviews of 45 minutes, followed by lunch, and then 2 more interviews. These are basically the same as phone screens, but you get to see the interviewers face to face.

Imagine you are given 10,000 files, each containing 1 million integers. How would you sum all of them and provide the final result?

---> The interviewer wanted to test scalability and distributed concepts.

He has written the basic code and wants to improve upon it.

Here's the basic code:

java public int getSum(String[] file_names) { int sum = 0; for (String f : file_names) { sum = sum + sumOfFile(f); } return sum; }

Questions:

• What's wrong with the above code? Ans: Integer overflow.
• How would you implement sumOfFile?
• What if sumOfFile takes a lot of time to finish computing?
• How do you fasten the program?