Applied online for Yahoo Gemini and received a call from a Principal Engineer within 3-4 days, requesting a technical phone interview.

• 1 phone interview: Cleared and received an onsite request.

• 1 on-site interview: Had 6 rounds, each 45 minutes. However, one interviewer had to take PTO, so I ended up having 5 rounds, each 50 minutes. One of the 5 rounds was a lunch interview.

Phone Interview Question: Convert a BST into a Doubly Linked List.

Onsite:

1st Round: Scaling questions (don't recall them right now, a couple were related to Kap, DHT, Chord). Sockets. RPC. Reverse Linked List. Circular Linked List. Middle of Linked List.

2nd Round: Coding question: Given an array with unsorted integers, move all even numbers to the left side and all odd numbers to the right side. After that, sort the even numbers in increasing order and the odd numbers in decreasing order.

3rd Round: Lunch. Overview of the team and asking questions about what you are looking for and why you are leaving your current company.

4th Round: Coding question:

1. Write a function that takes two inputs (word, random_string) and returns true if you can construct the word from the random_string, or false otherwise. For example, "apple", "sxryppaelwb" will return true, but "apple", "srxypaelwb" will return false.
2. Write a function that sorts an input word list into decreasing order of string length, but only if each word can be constructed from the random string.

5th Round: Basic Logical question:

1. Stack increasing/decreasing question and code.
2. ps aux | grep "myscript" related question.