Candidatei-me por meio de recrutador(a). O processo levou 1 dia. Fui entrevistado pela Volt Information Sciences (Redmond, WA) em fev. de 2010
Entrevista
Pretty standard fare. Phone interview. Coding questions. Interview loop involved 4 people as I recall.
Perguntas de entrevista [1]
Pergunta 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.
Candidatei-me por meio de uma agência de recrutamento. O processo levou 5 dias. Fui entrevistado pela Volt Information Sciences (Redmond, WA) em jun. de 2008
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 1
Write a function to determine if two binary trees contain the same data & structure.