I applied through college or university. The process took 3 weeks. I interviewed at Tripadvisor in Oct 2013
Interview
Applied through a recruiter in my school's tech career fair. Had an in-person interview the next day. An hour after my interview, I got an email saying I did well, and that they'd like to do a phone interview with me.
My phone interview finally happened over 3 weeks after the original interview. They had me program on a shared document - so the engineer at the other end could see what I was writing as I was writing it.
I didn't do too well, and a day later they sent me an email saying "thanks but no thanks".
Interview questions [1]
Question 1
Assume there are duplicate values in a BST tree containing Integers; please write countDupes() and return an int for the count of duplicate values in the tree (the number of nodes to remove to make the tree contain unique values only).
5
2 9
1 3 8 9
7
6 7
5 7
AssertTrue("There are 4 dupes", 4 == countDupes());
return 4
I applied through college or university. The process took 1 week. I interviewed at Tripadvisor (San Diego, CA) in Oct 2013
Interview
I talked to an engineer at a campus job fair and got scheduled for an interview the next day. It was a 30 minute interview and completely technical. No behavioral questions were asked.
I was asked about HashMaps, Principles of Object Orientation, Binary Search Trees, lots of runtime questions (best, worst, average case). These were all just questions where I was asked about how I would implement them and other general java conceptual questions.
They got back to me within the next week.
Interview questions [1]
Question 1
Part 1) Write a function that checks if a string is a palindrome.
Part 2) What if the string has a bunch of spaces, but if the same letters are still in the string, it is still a palindrome? ie) _ _ _ a _ b _ _ _ a _ -> true
Constraint: you can't trim the spaces out or pull anything out of the string. Must be checked in place.