Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fui entrevistado pela Tripadvisor (Newton, MA) em out. de 2011
Entrevista
I had an initial phone screen, followed promptly by an in person visit which consisted of 4 one hour interviews back to back and got a decision on the same day.
Perguntas de entrevista [1]
Pergunta 1
Finding the depth of any arbitrary node in a binary tree
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 4 semanas. Fiz uma entrevista na empresa Tripadvisor.
Entrevista
Gave resume at career fair, got emailed for a phone interview about a month later. 30-45 minute phone interview, asking how to merge two sorted lists in linear time. Interviewer seemed to be just a regular guy, wasn't a bad experience.
Question:
Merge two sorted lists (of ints) in linear time. Make sure to account for possible duplicates. The way to answer it is like how you sort lists in mergesort. (In other words, if x[0]>y[0], list_to_be_returned[0]=x[0], x=x[1:] and repeat.)
Perguntas de entrevista [1]
Pergunta 1
TripAdvisor's motto is "speed wins" so do it quickly
Candidatei-me online. O processo levou 2 semanas. Fiz uma entrevista na empresa Tripadvisor.
Entrevista
Phone interview, ask about experience and background. Then asked me to implement a merge sort. About a week later, I was given a homework problem to do over the weekend, which was writing a console program that allows user to sort data according to their specifications. A week after that they informed me that I did not pass the homework problem.
Perguntas de entrevista [1]
Pergunta 1
Console program that sorts data according to user specification
