I applied through other source. The process took 2 weeks. I interviewed at Microsoft (Belgrade, Central Serbia) in Mar 2020
Interview
Technical interview with 4 algorithm tasks. 1 regarding arrays, two with linked lists and one with binary three. The one with the binary three was the hardest one. I managed to solve all of them for given test cases, but the performance I provided was not good and probably that was the reason why I didn't get the offer.
Interview questions [1]
Question 1
1. Array 2. Linked list 3. Linked list 4. Binary three
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
