Wednesday, May 16, 2007

Interviews...

Over the last three weeks I've been interviewing with a certain company. The interview process has been very interesting. At each stage the interview questions just got harder and harder. I guess thats the norm. Its just that its been quite a while since i was subjected to this kind pressure, and to tell you the truth, i truly enjoyed it!

The questions ranged from data structures,
- Where they test your ability to select the most appropriate data structure to solve a problem
- awareness of common data structures and how you would traverse through them

To some really interesting algorithm questions like,
- write an algorithm where given an array of numbers (ints) , find the number of pairs that sum up to a given number.
- given a n by n matrix or integers, where each row is sorted in ascending order and each column is sorted in ascending order. Find a particular number in that matrix.

The question is fairly straightforward. However, they are not looking for the regular question anybody would give. They are looking for the smarter ones who think about more optimized ways of executing this algorithm. Therefore, the next part is generally focused around complexity.

The last interview was the most toughest. It covered all areas including, scalability concerns, fault tolerance and fail over, performance and availability strategies. All in all, whatever the outcome, I thoroughly enjoyed the experience. All of my interviewers were very easy-going friendly people who had the knack of setting the interviewee at ease.

Heres a link i found pretty useful,
http://discuss.techinterview.org/?interview

No comments:

Search This Blog