I applied online. I interviewed at Microsoft (Tokyo)
Interview
First step was sending an application online including a resume and a 3 page project description. I was then invited to an online coding test. After that I was invited to an interview in Tokyo where I had 3x 1h interviews with an engineer. Those interviews consisted out of a self-introduction from myself and the engineer, and some problems. For me, all these engineers were from the same team. I didn't do particularly well on neither the coding test nor the interview problems, but I got an offer which I accepted.
I believe the main reason for this offer was the experience I had through my past projects. I don't speak Japanese well, but that wasn't a problem as the interview was held in English.
Interview questions [2]
Question 1
Longest substring in a string without any double characters.
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 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.
