Fast-paced, self-driven, flexible, and fun
Fast-paced, self-driven, flexible, and fun
Flexible work schedule, interesting and broad engineering work will keep you interested for a long time.
All sorts of perks and free snacks.
People are nice and laid back (at least the people I have seen and worked with).
Moves really fast, with a considerable amount of pressure (good or bad). It is in Newton, and the new building will be even further away from the city.
Sometimes upper management can be a little aggressive. They should know the difference between people who try their best to meet expectations and those who are pretending.
Was this helpful?
Tripadvisor Interview Questions
Tripadvisor Interview Experiences
Software Engineer
Phone interview with the hiring manager, followed by an office visit for in-person interviews with two engineers and the hiring manager.
Software Engineer
The process began with an email from them, followed by a brief 10-minute phone call with one of their recruiters. After the call, they scheduled a technical phone screen. The technical phone screen lasted approximately 30 minutes. Most of this time
Software Engineer
I had one phone interview that involved coding a binary search tree and implementing an insert() and findSumAtLevel(int n) routine. I then went to their Newton office, where I was interviewed by three engineers. Questions focused a lot on binary sea
Software Engineer
Newton, Massachusetts, United StatesMarch 1, 2010Phone interview with the hiring manager, followed by an office visit for in-person interviews with two engineers and the hiring manager.
Software Engineer
Newton, Massachusetts, United StatesApril 1, 2013The process began with an email from them, followed by a brief 10-minute phone call with one of their recruiters. After the call, they scheduled a technical phone screen. The technical phone screen lasted approximately 30 minutes. Most of this time
Software Engineer
Newton, Massachusetts, United StatesFebruary 1, 2011I had one phone interview that involved coding a binary search tree and implementing an insert() and findSumAtLevel(int n) routine. I then went to their Newton office, where I was interviewed by three engineers. Questions focused a lot on binary sea
