Candidatei-me por indicação de um funcionário. O processo levou 2 semanas. Fiz uma entrevista na empresa Microsoft (Tel Aviv-Yafo).
Entrevista
Phone call with HR, and then there was a short zoom HR interview. There was a short home assignment, 2 interviews on zoom with senior engineers. After passing those interviews I was interviewed by the team leader. Overall a good experience, but they did not give me an answer on the date they said they would which contributed to me signing with a different company.
Perguntas de entrevista [1]
Pergunta 1
HR interview: General personality questions, and asked about basic cs terminology (what are linked lists etc). home assignment was leetcode style that was pretty easy. senior engineers - The first one asked fo write a code that apply chandes to a binary tree, and the second one was another leetcode medium type of code. All interviews (other than HR) included writing the code live and running it.
Fiz uma entrevista na empresa Microsoft (Tel Aviv-Yafo).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 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.
Candidatei-me por meio de uma faculdade ou universidade. Fui entrevistado pela Microsoft (Haifa) em jun. de 2026
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
