Related InterviewSolutions

• It was basically 1 question round but that had two parts . one designing the algorithm optimally . And writting and covering all possible scenarios and write test cases for them.It was based on deleting elements from an array form a given index .Indexes w
• This round covered Data structure based prograaming as well OS concepts on multithreading as well
• Given a circular linked list containing sorted elements (int value). The head of the linked list points to a random node (not necessarily to the smallest or largest element). Problem is top write a code which will insert a node at its correct position. E
• One question was to design data structures to delete pages from a web server which are no longer in existense and have no link on website .That is pages which have expired and no longer in use and has no refernce on any of the page son current website
• This was the last round .Questions based on college projects and training project was asked.A question was asked to design an algorithm for a new type of contact search application of mobile phones