I applied online. I interviewed at Microsoft in Oct 2018
Interview
I contacted a recruiter, applied online, then was contacted to schedule a phone interview. They asked questions about my work experience and personal projects such as "What algorithms and data structures did you use in this project and why?" and "What was the biggest challenge for that project and how did you overcome it?". Then they asked various questions to see how you think like, "How would you explain recursion to a child?". A few weeks after this I was contacted by the recruiter saying that they liked me and wanted to move on to an in-person, on-site interview, but there weren't enough available interview slots. So, they put me on a wait list essentially.
Interview questions [1]
Question 1
There was no one question that was most difficult, but the interviewer clearly had a set list of questions to ask and some of them really didn't apply to my personal projects or work experience so I couldn't properly answer them.
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 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.