J'ai postulé via un recruteur. J'ai passé un entretien chez Microsoft (Fargo, ND) en nov. 2018
Entretien
The interviews started at 9am in Fargo, ND. I had interviews with a total of 4 engineers who had progressively more involved questions. After 3 hours of interviews with the first two engineers a third engineer took me to lunch on their campus, the food was fantastic. After lunch I interviewed with that engineer, and finished with the engineering lead manager to finish over 6 hours of interviews. The questions weren't too hard and the engineers were all more focused on how you approach the problems.
Questions d'entretien [1]
Question 1
Q: Given a string, find the longest sub-string of distinct characters. Give it's time and space analysis.
Q: Given a number, determine if it contains no more than one appearance of any number in a given set.
Q: Given a simple clock and the current time, how would you find the angle between the hour and minute hand?
Q: Construct a data structure in order to implement a tree with an arbitrary number of children. Implement functions to perform delete, insert, and lookup of nodes.
Q: Given a string, compress it so that aaabbbccc becomes 3a3b3c etc.
A leetcode style test with three problems, then three interviews with different managers ( for each it was a coding problem and behavioral questions). Each interview was 1 hour long
Questions d'entretien [1]
Question 1
How do I react and handle a conflict situation at work
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
I applied through their website with a referral, after a month or so they sent me a home exam, I think about a month after that i had 3 interviews in the same day, each one around 1:15 hours.
Questions d'entretien [1]
Question 1
implement a dictionary where you have set,get and setAll, all in O(1)
The hiring process consists of a HackerRank home exam, followed by three technical interviews covering LeetCode-style problems and system architecture. Once this is done, you will have a final HR interview.
Questions d'entretien [1]
Question 1
I had a technical interview where I was asked to solve the classic 'Climbing Stairs' problem (LeetCode #70), which is a dynamic programming question based on the Fibonacci sequence.