It was a standard technical interview, not easy but not too difficult, with an emphasis on recursion problems and code efficiency. The recruiters are prompt and on your side, so use them to your advantage. The interviewers were smart and quite nice, which reflects the good culture of the engineering organization.

1. Short recruiter call
2. 30-45 minute phone screen. Coding questions followed by some Q/A where you can ask the developer questions.
3. Onsite interview consisting of 4 interviewers, approximately 45 minutes each: A) Coding question B) Architecture question C) Behavioral questions with a small coding question D) More coding questions.

Tip: Use helper methods to keep your code clean. You may not actually need to code them out, saving you valuable time.

1A. Given a sorted array of integers, create a binary search tree from it. The solution is recursive.

1B. What if you are passed a sorted linked list instead of a sorted array? Create a binary search tree from this. The solution is recursive.

1. Compute the diameter (look up the definition) of a binary tree. The solution is recursive.

2. Architecture: Design the news feed from an Android client's point of view.

3. Given a dictionary of strings to translations, translate an input string. Translations may overlap. For example: 1->A, 11->B, 111->C. The solution is recursive and involves preprocessing the input dictionary.

4. Given a queue of jobs, their runtime, and a cool-down time, return the total time to finish the jobs. The input could be: A->3, B->2, A->3, A->3, and a cool-down of 2 after each job. The solution is iterative and quite simple.

5. Print a binary tree vertically aligned, where a node, its right child's left child, and its left child's right child are in the same group. The solution involves passing the groupId to each child. The right child will be currentNode.groupId + 1, and the left child will be currentNode.groupId - 1. Append to a Hashtable<int, LinkedList> keyed by groupId.