1st Phone interview - - Given a array of numbers and sum k, find a pair in the array that sum to k - Give an algorithm to print the paragraph of text based on the screen size 2nd Phone interview - - Find the m-th last element in a linked list - Given a large collection of characters(collection will have duplicates as well) and a dictionary, find an efficient algorithm to return the 10 longest words you can form using the characters in the collection. If a character is used in a word, it cannot be used in the next word. On site Interview - 1st round - Given meetings schedule of the participants. Find a slot when everyone is free 2nd round - - Each node has up, down, next pointers. Up points to a number less than self, down points to number greater than self. All the nodes are sorted. Flatten the linked list such that it has only next pointer and all the nodes remain sorted. - There is an inflow of ticker symbols and prices. Maintain min, max, last 5 prices seen - Decrypt a string of text. You are given a dictionary and a method that returns a score for a character which is less than 1. If we sum of the scores of all the 26 characters we get 1. 3rd round - senior manager There are 100 people sitting in a circle. Every second person is opted out. Who wins. 4th round - Casual discussion with senior manager 5th round - HR talked about experience through out the day and salary and benefits