I applied through university. I interviewed at Microsoft (New York, NY) in Oct 2018
Interview
I was invited to an on campus interview. The interviewer was a Senior Engineer for the location that I was interviewing for. They had two days back to back of 30 minute interviews, with I want to say roughly 10 people each day.
Interview questions [1]
Question 1
The coding question was to create a function that took in a string and you were supposed to write a compression algorithm by listing which characters were repeating.
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)
