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).
Questions were easy. Asked about Queue
Implementation of strtok
None. CS fundamentals. LList, Sorting, Arrays etc.
An array that has 8 bit slots but is storing 12 bit integers, so position zero stores the first eight bits of the integer, and the first 4 bits of position one store the last 4 bits. The second 4 bits of position one store the highest bits in the second integer and position two stores the lowest 8 bits and so on. Devise a way to read these numbers from the array (in C)
Maze question.
I found it surprisingly easy overall.
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
Linked List Related
Viewing 1841 - 1850 interview questions