On-campus interview. The interviewer was pretty friendly and was approachable. It was about 10 minutes asking about general experience, the position I am applying for, and the resume. Then it was about 13-15 minutes of writing code on the whiteboard about data structure and algorithm. Overall, it was a moderately hard interview, and the interviewer helped walk through the process.
Domande di colloquio [1]
Domanda 1
Questions about experience and a coding question on traversing binary tree
Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Microsoft (Haifa) nel mese di giu 2026
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
