Le processus a pris 1 jour. J'ai passé un entretien chez IXL Learning (San Francisco, CA) en juil. 2011
Entretien
Had too phone interviews which I nailed. Some questions about inserting and deleting in binary trees. Wanted to hear the words red black but did not care to see implemented. Asked a couple of math questions. Prove that if n>6 and n-1 and n+1 are prime, then 6 divides n. Got invited for onsight interview. Got 5 different hour long interviews which were all take about polymorphism and efficiency. Good question: Given a list with R, B, and G only how do I sort it most efficiciently? I got to the an interview with the VP, which did not go as well as it could (after 5 hours no break), and no offer...
Questions d'entretien [2]
Question 1
Difference between a binary tree and a hash table?
J'ai passé un entretien chez IXL Learning (San Francisco, CA)
Entretien
Lengthy interview process with a super day at the end. 4 OAs to complete, all of these being quite easy. Then you move on to a technical round which you can solve if you practice enough leetcode hards. Final round is 3 technical interviews and a behavioral. I recommend reviewing priority queues.
Questions d'entretien [1]
Question 1
They asked me about my resume and about one specific project that I worked on and what I learned.
Leetcode question live with a engineer that was related to data structures and algorithms. around 30 minutes. On zoom. They gave special link to do the exam on and they told you question and let you run it .
Questions d'entretien [1]
Question 1
Leetcode questions similar to medium/hard level (stuff with hash maps)
There are multiple rounds. Starts with a phone call with a recruiter. After that, there is a technical round with an engineer, Then after that, it was three back to back technical rounds in the same day.
