Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Tripadvisor nel mese di set 2011
Colloquio
Their interviews are very algorithm heavy. Be sure to brush up on your knowledge of trees, hashes, and operational complexity. They start off with easy questions but ramp up very quickly. Be sure to understand what you are talking about because they have VERY good engineers and they WILL call you out on issues and problems that you make.
Domande di colloquio [1]
Domanda 1
Given a binary tree with integer values in each field, sum the entire tree.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Tripadvisor
Colloquio
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.
Domande di colloquio [1]
Domanda 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
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Tripadvisor nel mese di mar 2014
Colloquio
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
Domande di colloquio [1]
Domanda 1
Nothing unexpected. Very standard cs101 data structures related questions.