TripAdvisor's hiring process is very selective, and they hire top-notch engineers from top schools (MIT, Harvard). However, TA also has a "no a**hole" policy.
It's a very technical environment. The CEO has a software background. It's a data-driven company.
Very good perks:
Good compensation.
Flexible hours; could work from home.
The company promotes from within.
Hectic environment; some people put in more than 60 hours/week.
"Speed wins" mantra doesn't always work.
The communication between the teams could be improved.
Huge code base, and sometimes difficult to maintain.
Met a company employee at a university recruiting night. Stuck around afterward and handed my resume to the employee. The employee boasted about the work culture, describing it as laid-back and easy-going. They took my resume and sent an email the
A friend who was an employee submitted my resume. I had one phone interview and two onsite interviews. The office consists of two older buildings. I found the environment very friendly, although a bit dark. The interviews were all coding problems
This is a textbook technical interview, and all questions are to be expected. I mentioned this below, but be sure to be rock solid on your basic data structures and algorithms (trees and tree traversal, arrays, heaps, linked lists, hash tables, O-not
Met a company employee at a university recruiting night. Stuck around afterward and handed my resume to the employee. The employee boasted about the work culture, describing it as laid-back and easy-going. They took my resume and sent an email the
A friend who was an employee submitted my resume. I had one phone interview and two onsite interviews. The office consists of two older buildings. I found the environment very friendly, although a bit dark. The interviews were all coding problems
This is a textbook technical interview, and all questions are to be expected. I mentioned this below, but be sure to be rock solid on your basic data structures and algorithms (trees and tree traversal, arrays, heaps, linked lists, hash tables, O-not