I applied online. The process took 4 weeks. I interviewed at Microsoft (Redmond, WA) in Sep 2019
Interview
One behavioral phone interview, asked a bunch of questions about projects that were listed on my resume. Then they gave me a free flight and stay to their campus in Redmond, WA for a couple rounds of technical questions.
Interview questions [1]
Question 1
You have a sorted and rotated array {5,6,1,2,3,4}. Use binary search to find a specific number in it.
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.
Interview questions [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.
Interview questions [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.
I interviewed at Microsoft (Cairo, Cairo Governorate)
Interview
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.
Interview questions [1]
Question 1
Find the lowest difference between two numbers in a list
