J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez Thrillist (New York, NY) en déc. 2013
Entretien
I was contacted by the Company recruiter. 2 Phone interviews including a technical interview + 1 Onsite interview
Questions d'entretien [1]
Question 1
1. Write a function that will traverse an unbalanced, unsorted binary tree, looking for a node with a specific value. Your function should return a pointer to that node.
2. Write a small regular expression that will match most valid email addresses.
3. Write a program that, given a filename, returns the number of times the word “Thrillist” appears in the named file.
4. Database design question: An existing e-commerce system sells widgets to registered customers. The company has too much excess inventory. It wants to be able to offer discounts on certain products to certain customers, or certain groups of customers. How would you extend the schema below to support such an enhancement to the system?
5. Develop A Small Ad Server: For our mobile applications (iPad, iPhone and Android) we have to serve up different image advertisements to each different device. Generally our advertisers purchase their space for a month of time, but at times can be for only set periods of times. Sometimes they order for all three devices and other times for only one or two. Finally, each advertisement has a specific URL that the user should go to when they click on the advertisement.
We need you to describe how you’d build a small application to serve up these advertisements. You don’t need to write line by line code, but be able to describe the architecture of the system from a high level.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Thrillist
Entretien
Applied through my school's Job portal. Recruiter contacted me by email. After intial background check phone call, there were 2 rounds of technical interviews. First one was phone interview and second one was online (hangout) coding interview. Phone interview had questions about basic OOP and java concepts : Polymorphism, abstract class and static methods, get and post methods. Database : normalization, sql injection. Coding interview was somewhat difficult.
Questions d'entretien [5]
Question 1
Write a function that will traverse an unbalanced, unsorted binary tree, looking for a node with a specific value. Your function should return a pointer to that node.
An existing e-commerce system sells widgets to registered customers. The company has too much excess inventory. It wants to be able to offer discounts on certain products to certain customers, or certain groups of customers. How would you extend the schema below to support such an enhancement to the system? Existing schema has 2 tables : Users and Products
For our mobile applications (iPad, iPhone and Android) we have to serve up different image advertisements to each different device. Generally our advertisers purchase their space for a month of time, but at times can be for only set periods of times. Sometimes they order for all three devices and other times for only one or two. Finally, each advertisement has a specific URL that the user should go to when they click on the advertisement.
We need you to describe how you’d build a small application to serve up these advertisements. You don’t need to write line by line code, but be able to describe the architecture of the system from a high level.
Be prepared to describe:
● How would you serve up the mobile advertisements?
● How would the data for each advertisement be stored (i.e., what does the database look like)?
● How would you track how many times the advertisement has been viewed or clicked?
J'ai postulé via une agence de recrutement. Le processus a pris 1 jour. J'ai passé un entretien chez Thrillist
Entretien
I just made one interview, there wasn't much talking but just a bunch of technical questions: Algorithms and data structures, regular expressions, and design questions.
Questions d'entretien [1]
Question 1
The hardest question was related to manipulating a binary tree and doing some search in it. In fact, it wasn't that hard, but it was the very first question so it's kind of unexpected.
