J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft en juill. 2021
Entretien
It was an on campus opportunity, So we were provided Job ID from Microsoft and were askes to apply on career portal of MS for CGPA > 7.5 and then date for our OA was decided:
It was a test of total 80 minutes with 2 problem.
Both the questions were of grid type and difficulty lying between medium to hard.
I was able to solve only 1 problem so my name didn,t came in list of 40 students shortlisted for interview round.
This was my first opportunity.
Questions d'entretien [1]
Question 1
A 2d grid containing some obstacle and some gaurds each facing some direction and protecting entire row/column in front of them, Now a assassin is standing somewhere in the grid and want to reach end of the grid without being caught by gaurds and also he can not move on cell with obstacle or cells gaurded by gaurd or out of grid, We just need to return boolean value (0/1). He can only move in 4 adjacent cell in one move.
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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.
Questions d'entretien [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.
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 postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Haïfa) en juin 2026
Entretien
The process started with an online HackerRank assessment. The main coding question involved partitioning an array of server capacities into K contiguous groups while minimizing the maximum group sum. The solution required binary search on the answer combined with a greedy validation function. The assessment focused on algorithms, problem solving, and time complexity analysis.
Questions d'entretien [1]
Question 1
Given an array representing server capacities and an integer K, divide the array into K contiguous groups such that the largest group sum is minimized. Return the minimum possible value of the maximum group sum.