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.
Questions d'entretien [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.
Feeling thrilled to have accepted the offer, I look back on this interview process as both challenging and rewarding. It began with a technical round where I tackled a complex A/B testing design question, followed by a SQL query on user retention. The final stages included a system design discussion that had me sweating, but honestly, the system design section on PracHub prepared me well. Each step pushed my limits, but the culmination was definitely worth it, landing me a role at Microsoft.
Questions d'entretien [2]
Question 1
Design an A/B test to measure the impact of a new ranking change in Bing, and explain how you would handle network interference between treatment and control users.
Write a SQL query that computes 7-day rolling user retention from a daily events table, then flags cohorts whose week-over-week retention dropped more than 10%.
J'ai passé un entretien chez Microsoft (Le Caire, )
Entretien
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.
Questions d'entretien [1]
Question 1
Find the lowest difference between two numbers in a list
