Engineering applicants have rated the interview process at Tripadvisor with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% positive. To compare, the company-average is 49.8% positive. This is according to Glassdoor user ratings.
Candidates applying for Engineering roles take an average of 8 days to get hired, when considering 3 user submitted interviews for this role. To compare, the hiring process at Tripadvisor overall takes an average of 20 days.
Common stages of the interview process at Tripadvisor as a Engineering according to 3 Glassdoor interviews include:
Phone interview: 33%
Skills test: 22%
One on one interview: 22%
Group panel interview: 22%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 1 day. I interviewed at Tripadvisor in Mar 2011
Interview
After an initial phone interview I was invited to come in for an in-person interview. I met with 4 people that day. Each person asked similar questions of varying difficulty. I was asked to solve specific problems on the white-board.
Interview questions [1]
Question 1
What would you change about the TripAdvisor website?
I applied through a recruiter. The process took 1 day. I interviewed at Tripadvisor (Needham, MA)
Interview
Very professional and interview questions were straight forward. Total of 4 staff members conducted the interview that lasted for about 2 hours. Overall a pleasant experience but would have been nice if TA responded to inquiries regarding status of position.
Interview questions [1]
Question 1
Why do you want to work for TripAdvisor? Where do you see yourself in 5 years? How would you do your job if you were in this particular situation?
I applied online. The process took 3 weeks. I interviewed at Tripadvisor in Feb 2013
Interview
Two telephone interview one with the Team Lead another with the Director of Engineering.
Interview questions [1]
Question 1
Count the number of duplicate elements in a Binary Search Tree , they are looking for specific answer , it has to be an inorder traversal with previous node matching . The 2nd interview was inserting in BST using the function prototype insert(int n); The program should work for
BST root=new BST();
root.insert(10); You can create the class any way you want but there are restrictions like you have to use primitive(int) as the value .