I applied through college or university. The process took 1 week. I interviewed at Tripadvisor
Interview
Met TripAdvisor at the campus job fair at UW Madison and after a couple of questions on complexity analysis of basic data structures, was asked to meet for an on-campus interview the next day. For the interview, I was asked questions based on divide-conquer recurrences and some more complexity analysis- nothing unexpected. I think my solution worked and even the interviewer thought so, but I got a message from the HR saying they had decided to move forward with other candidates.
Interview questions [1]
Question 1
Not any, just basic recurrences and complexity analysis.
I applied through other source. The process took 1+ week. I interviewed at Tripadvisor (New York, NY) in Dec 2016
Interview
There was a telephonic interview, followed by a coding assignment and then an on-site interview. The interviewers were very helpful and friendly. There were some very practical questions on algorithm complexities.
Interview questions [1]
Question 1
1. (Telephonic) Given a sorted array, find a number.
2. (Telephonic) Write a program to tell if the right subtree and right subtree of the root are mirror images.
3. (Telephonic) Making the program in 2 scalable and run on multiple machines
4. (Coding assignment) Write a plagiarism checker
I applied through college or university. The process took 2 weeks. I interviewed at Tripadvisor (Ithaca, NY) in Oct 2015
Interview
I applied through my university and talked to TripAdvisor at the career fair. After the career fair they gave me a Skype technical phone screen. The interview itself involved coding in front of the interviewer and talking through your thought process (standard tech interview protocol). I choked at one point and totally blanked on an algorithm implementation, but the interviewer let me sit and struggle with it for 20 minutes, which was uncomfortable, but fair.
Interview questions [1]
Question 1
Given a string, find the 10 most common words in the most efficient way possible