Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Tripadvisor en mar 2014
Entrevista
Two phone interviews covering:
1. Find and remove all numeric characters in a singly linked list
2. Questions about basic data structures, trade offs, use case, access complexities
3. Given string A, B, return string A - (A intersect B)
4. implement basic hash table and collision handling
5. Discuss algorithmic complexity of solutions in all cases
Preguntas de entrevista [1]
Pregunta 1
Nothing unexpected. Very standard cs101 data structures related questions.
Me postulé a través de una facultad o universidad. El proceso tomó 4 semanas. Acudí a una entrevista en Tripadvisor
Entrevista
I applied for this company on our campus career fair, and in the next few days they scheduled me an on-campus interview. One person interviewed me for about 45 minutes. Only technical questions, didn't ask me about my project or something else. He asked me to write code in a white board and then asked me some question about the code.He also told me there would be 3 rounds of interviews.
Then I received an email telling me I passed the interview and then came up the 2nd round - telephone interview. It's a 30-minute interview asking a quite simple question and some extensions. Then he started to introduce the job and environment of their company.
And after maybe 2 weeks, there will be an on-site interview if you pass the previous one.
Preguntas de entrevista [1]
Pregunta 1
Nothing difficult. The first question is about combination of HashMap and ArrayList, which the best answer should be LinkedHashMap but it's OK if you didn't know about this class.
The second interview is to find the same element in two lists
