In total 7 rounds. 1st interview Telephonic- Gave a code to find out bugs and suggest improvements, Binary sort 2nd telephonic round - merging two linked lists in sorted order without using extra spaces This was followed by final call on skype which had 5 rounds in a day, This is tricky since if they have anyy doubt on any part, since its a skype interview its not in the favor of the candidate, if that had been onsite, it could've been better. 3rd skype- out of n elements which can be unsorted with duplicates, output the indices of the three highest valued elements 4th- Binary tree question- given a node, how to find the height + print a given string (string) in the order: s st str stri strin string t tr tri tring r..... 5th- print the permutations of a given string + T9 implementation [I actually solved both in the 1 hr of interview round!] 6th- given a string - tuTutuuti, print it as output: t3u4T1i1 in O(n) time without using any extra spaces and maps/etc other data structures 7th - find the height of the tree recursively + merge sort Also random java questions in almost all the rounds.. Interview did went well except for 6th round which was taken by a female who was asking questions on how can u do this and how can you do that in the coding question which was coming out in a rude tone making it sound more like how dare you do this and that, so I figured out why I was rejected...