I applied through a recruiter. I interviewed at Microsoft in Oct 2019
Interview
Reached out to by a recruiter on LinkedIn, who set up a first round interview with a Microsoft Engineer coming to my college. Interview was kind of wacky, and he didn't ask me questions, I had to bring up my experiences on my own. A couple weeks later got flown out to their Seattle campus for a tour and 2 back to back hybrid technical/behavioral interviews. Coding portion was very manageable. Had a deadline coming up, so they got me a decision in only 3 days. Overall a good experience and had a lot of fun exploring Seattle for a day!
Interview questions [1]
Question 1
Tell me about a time you faced a difficult technical challenge and how you overcame it
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.
