I applied through university. I interviewed at Microsoft (Mission Viejo, CA)
Interview
Met recuriter at job fair. Had on campus interview within a week with current employee, was a developer. Talked about projects I had worked on and my experience, answered questions about Microsoft. Couple weeks later received an email stating I had an interview at Microsoft in Mission Viejo. Flight was cancelled due to weather, ended up interviewing over skype with 4-5 employees on 2 teams at location. Asked to solve problems by each.
Interview questions [2]
Question 1
Implement Quicksort. After implementing, implement a version that takes less space complexity (2 pointer quicksort. )
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
I applied through a recruiter. I interviewed at Microsoft (Tel Aviv-Yafo)
Interview
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)
Interview questions [1]
Question 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)