The interview was scheduled on Microsoft Team application. Interview panel consisted of 2 members.
Prof 1: Give a brief introduction about yourself
Prof 1: What are the different search algorithms you know?
Prof 1: What is the worst best and average case of binary search algorithm?
Prof 1: Have u heard about ternary search. Explained it in a sentence and asked what is its complexity?
Prof 1: Prove how binary search is better than ternary search
Me: Stumbled a bit.
Prof 2: Gave a probability question where there are balls numbered from 1-13 what is the probability that if you remove 2 balls uniformly at random the probability that their MSB is same.
Prof 1: Can you prove or disprove the sentence. The minimum and maximum values are always present as leaf node in binary search tree.
The interview was one of the shortest interviews experienced. The professors were very helping and cooperative. The interview was a great learning experience to me.