J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Redmond, WA) en sept. 2017
Entretien
Had a phone call for 30 minutes in March. Largely behavioral, but I was asked brain teasers at the end.
I was flown out in September to interview in Redmond. The experience was amazing, they really treated you well by paying for all necessary expenses and any sightseeing. On the day of the interview, I got to meet the other candidates in the morning and got lunch. Then we had 4 back to back rounds. These interviews were focused largely on Algorithms and thought process. I was asked 1 recursion/DP question, 1 graph question, 1 System Design, 2 Brain teasers, and 2 basic Data Structures questions overall. The interviewers did a good job at keeping you calm and focused during the interviews. It was a great experience overall!
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.
J'ai passé un entretien chez Microsoft (Le Caire, )
Entretien
One HR interview, then two problem-solving interviews (beginer level) on HackerRank. You can choose the best programming language for you to use in solving problems. You should think out loud to enable your interviewer to understand how you would think to solve the problem.
Questions d'entretien [1]
Question 1
Find the lowest difference between two numbers in a list
J'ai postulé via un recruteur. J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Questions d'entretien [1]
Question 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)