J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Lucknow) en janv. 2026
Entretien
The OA was simple. There were two interview rounds. The interview focused on problem solving, logical puzzles, and some system design concepts like caching and database optimization.The HR round had one dsa , one behavourial and one os based question. The interviewers were friendly and the difficulty level was moderate.
Questions d'entretien [6]
Question 1
1. Find pairs with minimum absolute difference in an array (Closest latency spikes).
HR ROUND
Strengths and Weaknesses
Cooredinates of two rectangles are given how would you find if they intersect or not
how to make your system crash using code.
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.
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
J'ai postulé via un recruteur. J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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)
Questions d'entretien [1]
Question 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
