J'ai postulé via un recruteur. Le processus a pris 1 jour. J'ai passé un entretien chez Volt Information Sciences (Redmond, WA) en févr. 2010
Entretien
Pretty standard fare. Phone interview. Coding questions. Interview loop involved 4 people as I recall.
Questions d'entretien [1]
Question 1
Write an algorithm which takes as input a node and returns whether or not the tree structure contains a loop. Assume that a node has at most two pointers to children, but no pointers to parents.
J'ai postulé via une agence de recrutement. Le processus a pris 5 jours. J'ai passé un entretien chez Volt Information Sciences (Redmond, WA) en juin 2008
Entretien
After talking with the recruiter, they set me up with 2 interviews on-site at Microsoft. Two days after both interviews, I heard back from the recruiter with an offer, which I accepted the next day.
Questions d'entretien [1]
Question 1
Write a function to determine if two binary trees contain the same data & structure.