I applied online. The process took 2 days. I interviewed at Microsoft (Hyderābād) in Nov 2024
Interview
There were 3 rounds:
1. Coding round online. Codility platform
2. Technical round:
1. I introduced my self and he shared another codility link and asked me 2 questions. 1 on OOPS and the other on DSA.
2. I explained every step and started with a verifying the question and pseudocode before jumping into the actual code.
3. HR round: He asked me situational questions. Something about my resume, my experiences in college where I tookup leadership positions or worked with a team. Other extra curricular activities etc.
Interview questions [1]
Question 1
How would you approach a situation where your friend or collegue asked for your participation in a task but you are not that interested?
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.