J'ai postulé via la recommandation d'un employé. Le processus a pris 4 semaines. J'ai passé un entretien chez Microsoft (Redmond, WA) en oct. 2018
Entretien
Got onsite interviews after a single on-campus interview. Flown out to Seattle during the school week. Was in Redmond for two nights, flew back on the morning of the third day.
Got to see the Microsoft commons and grab lunch (with a lunch voucher) with other interns.
Had 4 interviews back to back. Each ~45 minutes, with about 20 minutes in between and one 1 hour break.
Three of the interviews were technical, with some talk about previous work experience. If I finished the question early I was given another, harder question.
One was behavioral. This was the most relaxed interview.
Questions d'entretien [1]
Question 1
You're given a Go board where each space is either white, black or empty. It is represented as an array. Return the number of contiguous blocks of white spaces.
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.
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