Candidatei-me por meio de uma faculdade ou universidade. Fiz uma entrevista na empresa Microsoft.
Entrevista
There were 3 interview. First two were based on DSA alone, 3rd was more about Resume and HR. I thew first interview they asked a binary search based question of medium diffculty. In the second they asked a tree traversal based question and in the 3rd they asked from resume.
Perguntas de entrevista [1]
Pergunta 1
There were 3 interview. First two were based on DSA alone, 3rd was more about Resume and HR. I thew first interview they asked a binary search based question of medium diffculty. In the second they asked a tree traversal based question and in the 3rd they asked from resume.
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.
