It was all technical questions. First question was to write a fizzbuzz program. Second questions was, given two lists containing names, find the common names in the lists. Third question was, given an array in an ascending order, and given that you know that there is at least one integer missing from the array, determine this number. I was also asked complexity of binary trees. The interviewer was a nice guy. He was so cool.
Check out your Company Bowl for anonymous work chats.