Candidatei-me por meio de recrutador(a). O processo levou 1 dia. Fui entrevistado pela Tripadvisor em out. de 2014
Entrevista
A recruiter reached out to me, said TripAdvisor would be interested in my profile and, in case things go well, sponsor a working visa (I am not a US citizen).
I had a technical interview on Skype with a Technical Manager. He made me feel extremely comfortable during the whole call. He first asked me why I wanted to join the company, then wanted to know more about my previous job as Data Scientist.
Theoretical question: Hash Table and its complexity.
Practical questions (answered on shared, real-time text editor): Intersect two sorted arrays/lists; Linked List + Fibonacci indexes. For each solution I was asked the complexity of it.
Pro: it is possible to choose between many programming languages, such as Java, Python, JS, …
Unfortunately, I kinda screwed up the Fibonacci question. Everything was quite easy. Anyways, it's been 20 days since I was interviewed, haven't received any news neither by the recruiter, nor the company.
Perguntas de entrevista [3]
Pergunta 1
// Given a singly linked list without values defined by:
class Node {
Node next
}
// Write a function that removes all elements from the list whose _index_ is a fibonacci number
// o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o -> o
// 0 1 2 3 4 5 6 7 8 9 10 11
// x x x x x
// becomes
// o ----------------> o ------> o -> o ------> o -> o -> o
// 0 4 6 7 9 10 11
# Q1: Write a function to intersect two *sorted* lists (find common elements)
# Write a method taking two lists as input, and returning a new list
# You can assume you have a reasonable array/list class available (ArrayList, vector, python list, etc)
# Ex:
# l1 = [1,2,3,4,5]
# l2 = [1,5,7,11,100]
# result = [1,5]
# Q2: Same as Q1, but now assume there can be duplicates. The output should not have duplicates
# Ex:
# l1 = [1,2,3,4,5,5,5]
# l2 = [1,5,7,11,100]
# result = [1,5]