There is a long contact list in a mobile phone storing Name and other details. Your task is to give the data structure and algorithm for efficient searching among the contacts. As the user types the letters in the text field, the screen should show all the names beginning with those letters (of either first or last name or any other word in the name).
Lots of data algorithms - make sure you know this stuff
What are your weaknesses?
I've heard rumors about the weird questions they could potentially ask you. Maybe I was prepared because I didn't find any questions difficult or unexpected. Most of the questions were technical in nature. How would I do this and that; draw certain algorithms on a white board. etc
Least common ancestor without using recursion
You have a tree where every node has 1 sibling and 1 child. My interviewer said this structure would be used to implement a File menu. Each node had a boolean T/F value. I had to write code to search the tree and find the first value that was T. All siblings of the same level had to be searched first, before any children were searched.
the first phone screening was about my previous tasks and projects. the second one started with my experience and then some testing questions.
They asked me a lot about linked lists!
Need to be good in data structures
he asked questions about pointers in C/C++
Viewing 1851 - 1860 interview questions