I applied online and get scheduled a phone interview consisted of 2 sessions of 45 mins each. The first interviewer is kind of tough and speaks really fast. She asked me to introduce myself and then ask me about the datastructures I am familiar with. Then she asked the time complexity analysis about BST and hashtables and asked me to code a program to check if a binary tree is the subtree of another. The second interviewer goes straightly into technical questions and ask me to write a program to find the largest possible value of an integer array with limited number of swaps in the neighboring elements. Eg. an array of 1,2,3,4, the max value with 1 swap is 2,1,3,4, and with 2 swaps is 3,1,2,4. After that he ask me how to find the perfect numbers,which can be represented as a ^ m + b ^ n (a, b >= 1, m, n >= 2), between 1 and 1M. I was kinder of nervous coz this is my first interview with such a tough company and really didnt do well though the questions don't seem to be that hard. lol