I had two phone interviews and I thought both went pretty well but a week later I was notified that they are considering other candidates. The interview consisted of questions on Search Algorithms, Data Structure, Big O analysis, followed by coding problem. I was stuck with one coding question during 2nd phone interview but I finally gave the solutions. It may not be impressive that I did not respond quickly. Here are some of questions that I was asked: 1. Complexity Analysis on Mergesort, Heapsort, Quicksort, and Selectionsort. 2. When quicksort can be O(n^2)? --If you choose bad pivot 3. Write a code to reverse binary bit pattern for an integer without using any string or utility methods? 4. Reverse a linked list 5. Implement a Fibonacci function. 6. Implement a function that convert asci value to int.