The interviewer puts an unnecessarily amount of pressure on a third year collage student by talking about there careers in details when most of what they are saying we don't fully understand, making it harder for them to show there real skills, also one of the interviewers where talking to someone else leaving the mic open while I was solving a problem.
Interview questions [1]
Question 1
they asked me to implement the add method for a binary tree followed by a problem to try to find it's brute force solution, the second interview was to implement an algorithm with 3 pointers to shrink a string by the number of repeated characters and override the original string with the answer.
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.