Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Microsoft (Redmond, WA) nel mese di nov 2024
Colloquio
Applied directly through LinkedIn. No Referral. Immediately to final round (2 back-to-back 45-minute interviews). First Round: Resume Questions, Behavioral, 1-D DP LC. Second Round: Resume Questions, System Design, Problem Solving Process. Took about 1 month from application to offer. 4 previous internships (2 FAANG+)
Domande di colloquio [1]
Domanda 1
Questions about Operating Systems because I said I took an OS class
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.
