Interview - 1

This story began when I received an email from X.com on 18th Jan 2010 to schedule an interview with them.
I provided them my availability for the interview and they scheduled me for an interview on 29th Jan 2010.

But on 27th Jan, I felt so nervous and felt that I was not prepared at all. So, I mailed them back asking to reschedule my interview to 5th Feb.

My recruiting coordinator was such a nice lady that she rescheduled my interview to 5th Feb.

Finally, I had a telephonic interview scheduled on 5th Feb 2010 at 1pm MST, I kept waiting until 1:30 pm but my phone did not ring. So, I emailed them asking if I would get a call for interview after that. But, she apologized me and said that they could not call me today for some reasons and so they will have to reschedule my interview. After, that she asked me my availability for rescheduling the interview.

Later, it was scheduled on 10th Feb 2010 Wed.

On the day of interview, I was very nervous as it was my first ever telephonic interview. Actually speaking, it was my first ever technical interview.

I was ready by 11:30 am. I occupied a peaceful, quite place at my home and was waiting for the call as I was waiting on 5th Feb :) But, this time I was sure that they would call.

Round 1
Date : 10 Feb 2010
Time: 12 noon MST
Day: Wednesday

1. Introduce yourself.
2. Why do you you want to work with XYZ?
3. You are given a set of log files which have some errors in it. How would you do it?
3a. You need to print the number of occurrences of word error not all the lines where "error" occurs.

-Which language are you comfortable in? I would like to ask you something about the language concepts: C++ / Java ?

4. Explain Virtual functions. (C++)
4a. Explain the difference between Class and Struct in C++.
5. Multiple Inheritance.
5a. Disadvantages of Multiple Inheritance.
6. Do you know about design patterns: Tell me what is Singleton design pattern.
7. Name the data structures (Tell me a list of data structures - array, linked list, trees, heaps, hashtable and then a long pause .. I felt as if he was expecting a few more but I did not speak anything I was not able to think any more data structures..:D)
8. Find the Non repeated chars (array of char)- Time space complexity
Array approach - Time O(n^2) Space O(1)//without considering the original array
Hash table approach - Time O(1) Space O(n)

-What if you know that the array contains only chars ---> Time O(1) and Space O(26)->O(1)
-What if the array contains only numbers? Would you like to change your best choice of data structure of hash table for the defined problem?

9. Find a cycle in the linked list and mail the code.
10. Bye :|

Round 2 - yet to write!! :) !!