J'ai postulé via un recruteur. Le processus a pris 2 mois. J'ai passé un entretien chez Microsoft (Redmond, WA) en oct. 2018
Entretien
Received a DM on LinkedIn from a Microsoft recruiter, saying that she was impressed with my profile and asked me to apply to Microsoft's SWE/PM internship. I applied and messaged her back telling her I applied online. Got an on campus interview request 4 days letter.
On campus interview was 15 minutes behavioral followed by 15 minute technical coding question. Got the onsite interview 10 days later, scheduled it 3 weeks from the call day (to give myself time to prep). Went onsite to Redmond, interviewed four rounds for Azure/Windows, and got the offer 9 days later.
Questions d'entretien [1]
Question 1
2 string/array questions, 1 hashmap question, 1 system design question, 1 sorting question, 1 expression tree question, 1 trie question.
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
