1st Phone Interview:

• Given an array of numbers and a sum k, find a pair in the array that sums to k.
• Provide an algorithm to print a 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 (which will have duplicates) and a dictionary, find an efficient algorithm to return the 10 longest words that can be formed using the characters in the collection. A character used in a word cannot be used in the next word.

On-site Interview:

1st Round:

• Given meeting schedules of participants, find a time slot when everyone is free.

2nd Round:

• Each node has up, down, and next pointers. The 'up' pointer points to a number less than itself, and the 'down' pointer points to a number greater than itself. All nodes are sorted. Flatten the linked list such that it has only a 'next' pointer, and all nodes remain sorted.
• There is an inflow of ticker symbols and prices. Maintain the minimum, maximum, and the last 5 prices seen.
• Decrypt a string of text. You are given a dictionary and a method that returns a score for each character, which is less than 1. The sum of the scores of all 26 characters equals 1.

3rd Round (Senior Manager):

• There are 100 people sitting in a circle. Every second person is eliminated. Determine who wins.

4th Round:

• Casual discussion with the senior manager.

5th Round:

• HR discussed the experience throughout the day, salary, and benefits.