Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Microsoft (Bhopal) en jul 2021
Entrevista
1st round was a coding round and it had 2 easy-medium question. After that selected candidates were called for interview after 5-6 days. In the interview i was asked some computer science fundamental questions on dbms followed by 1 coding question, I was not able to code the problem well so i was rejected.
Preguntas de entrevista [1]
Pregunta 1
given an array of points of size n find k nearest point from origin.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 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.
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Microsoft (Haifa) en jun 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
