Explorer Intern applicants have rated the interview process at Microsoft with 2.8 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 71.4% positive. This is according to Glassdoor user ratings.
Candidates applying for Explorer Intern roles take an average of 45 days to get hired, when considering 4 user submitted interviews for this role. To compare, the hiring process at Microsoft overall takes an average of 44 days.
Common stages of the interview process at Microsoft as a Explorer Intern according to 4 Glassdoor interviews include:
Phone interview: 43%
Presentation: 29%
IQ intelligence test: 14%
Personality test: 14%
Here are the most commonly searched roles for interview reports -
I have taken the first interview so far. I was alright and the lady was very friendly. I will keep you guys updated if they reach out to me. But the phone interview was great.
Interview questions [1]
Question 1
What is one technology you don't like? What do you like so much about technology? Why Microsoft?
Easy phone screen interview. Easy behavioural and data structures questions were asked. Interview time for phone screen is 45 minutes. Second and final interview is 2 back to back interviews of 45 minutes each.
I applied online. The process took 3 months. I interviewed at Microsoft (Redmond, WA) in Oct 2022
Interview
Good, very long process but the recruiters are good with getting back to you and giving you updates. The phone screen was not super easy but all the questions asked were on here. Interview, practice leetcode easy to medium (at most) and work on questions like "why microsoft" and basics of PM.
Interview questions [1]
Question 1
Phone Screen: 1) how would you design a phonebook? 2) What is your favourite microsoft product and why? 3) least and most favourite product and why? How can you improve each of them? 4) What got you into tech? Final Round: 1) questions about resume and experiences 2) linked list question that got progressively harder but not super hard. ie, start with traversal all the way to making two recursive functions that count nodes when the linked list has a cycle.