I applied through an employee referral. I interviewed at Microsoft (Herzliya) in Mar 2021
Interview
1 . 40 min skype call Behavioral - with someone from canada, kind of HR interview.
2 . 80 min codility test
- you can use any prog language you want.
- medium difficulty
3. 60 min coding
4, 60 min coding
-- very hard interviews. might ask you about operation systems.
5. interview with the team head
Interview questions [1]
Question 1
40 min - zoom meeting. Behavioral interview
1. how woud you explain recurison to a six years old kid.
2. 9 coins 1 is heavier then the other.
80 min codility test -
- long binary num-
how many time need to divide by 2 or if odd subtruct 1 to reach
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.