I applied through college or university. The process took 1 week. I interviewed at Microsoft (Bombaim) in Aug 2021
Interview
This was campus internship hiring for 3rd year undergrads. There was a technical test involving 2 coding questions, one of which was fairly simple, and another was also fairly simple, if one had previous experience with coding questions. (I practiced on interviewbit.com, which was helpful to me. Its not a platform to compete like codeforces, but a collection of questions based on topics)
Interview questions [3]
Question 1
Q1. A manager has a meeting schedule given in (startTime, endTime) pairs. Determine the total hrs he has to spend on these meetings. There can be overlap in between these meetings.
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 applied through college or university. I interviewed at Microsoft (Haifa) in Jun 2026
Interview
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.
Interview questions [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.
