Phone interview Question: Convert a BST into Doubly Linked List Onsite 1st Round: Scaling questions (don't recall them right now, couple of them 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 on left side and all odds on right side. After that sort even in increasing order and sort odd in decreasing order 3rd Round: Lunch. Overivew of the team and asking questions about what you are looking for and why are you leaving your current company 4th Round: Coding question. 1) Write a function which has 2 input (word, random_string), return true if you can construct the word from random_string or else return false. For e.g: "apple", "sxryppaelwb" will return true but "apple", "srxypaelwb" will return false. 2) Write a function which will sort the input word list into decreasing order of string length only if that word can be constructed from random string. 5th Round: Basic Logical question. 1) stack increasing decreasing question & code 2) ps aux | grep "myscript" related question.