J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Tableau Software (Vancouver, BC) en mars 2019
Entretien
An employee referral got me a 10-minute phone screen which was followed with a 25-minute online coding interview with a Senior Engineer. There were supposed to be 2 in person whiteboarding interviews after this stage but I was rejected after the online coding interview.
J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez Tableau Software en mai 2016
Entretien
Very well organized. Great panel and a lot of smart people. Great culture overall.
The process was very quick. The number of applicants pretty impressive but the recruiting and interview team was very committed to find the right match.
It was very enjoyable overall.
J'ai postulé en ligne. J'ai passé un entretien chez Tableau Software
Entretien
I was first sent an e-mail about my candidacy for an intern position over the summer, and scheduled a quick phone interview to learn more about the internship program, talk about which roles would interest me, if I would be willing to work in Seattle, etc.
About a week later, I had a 45-minute coding interview over the phone, which was somewhat algorithmically interesting yet fairly straightforward. The problem was to write a function to remove the elements in an array that appear more than once. Later that day, I got an e-mail telling me that the feedback was positive and that they would a final round interview consisting of two 45-minute coding interviews and a short conversation with a hiring manager. I decided to do the interview onsite, as this was an option.
The onsite interview was a bit disorganized because the company had just moved into a new space.
The first 45-minute interview involved tackling the problem of finding the top 1000 most frequent words in a file, better than O(nlogn) complexity. I gave various solutions that were of O(nlogn) complexity, then tried using min/max heaps and was also asked to explain Quicksort, Mergesort and analyze their complexities (explain why they are nlogn, not just from rote memory).
The second 45-minute interview involved developing and coding an efficient algorithm to find the "just less than" number in an unbalanced binary tree -- i.e. the largest number in the tree that was less than some target number. This was fairly straightforward.
Both interviewers were very nice. Then, I spoke to the hiring manager who answered some of my questions. I got an e-mail the next day saying they were moving on with stronger candidates.
Questions d'entretien [1]
Question 1
Find the top 1000 most frequent words in a text file, with better than O(nlogn) complexity, tree traversal problem.