I applied through university. The process took 3 weeks. I interviewed at Tripadvisor in Oct 2012
Interview
I heard back within a week of submitting my resume at my college's career fair. I had two phone interviews, which consisted of asking some basic concept questions, and then a coding problem. The coding problem generally consisted of topics involving binary trees and linked lists. They were definitely doable with some practice in those data structures.
Interview questions [1]
Question 1
I don't think there was any difficult/unexpected question. If you study data structures and read the advice on the TripAdvisor website, you can do well on the initial stages, I think.
I applied through university. The process took 4 weeks. I interviewed at Tripadvisor
Interview
I applied for this company on our campus career fair, and in the next few days they scheduled me an on-campus interview. One person interviewed me for about 45 minutes. Only technical questions, didn't ask me about my project or something else. He asked me to write code in a white board and then asked me some question about the code.He also told me there would be 3 rounds of interviews.
Then I received an email telling me I passed the interview and then came up the 2nd round - telephone interview. It's a 30-minute interview asking a quite simple question and some extensions. Then he started to introduce the job and environment of their company.
And after maybe 2 weeks, there will be an on-site interview if you pass the previous one.
Interview questions [1]
Question 1
Nothing difficult. The first question is about combination of HashMap and ArrayList, which the best answer should be LinkedHashMap but it's OK if you didn't know about this class.
The second interview is to find the same element in two lists
I applied online. The process took 2 weeks. I interviewed at Tripadvisor in Mar 2014
Interview
Two phone interviews covering:
1. Find and remove all numeric characters in a singly linked list
2. Questions about basic data structures, trade offs, use case, access complexities
3. Given string A, B, return string A - (A intersect B)
4. implement basic hash table and collision handling
5. Discuss algorithmic complexity of solutions in all cases
Interview questions [1]
Question 1
Nothing unexpected. Very standard cs101 data structures related questions.