I applied online. The process took 2 weeks. I interviewed at Microsoft (Israel) in Sep 2025
Interview
I got an e-mail with a link to a home assignement i had to do within a week. It was a home assignement with 2 coding questions one basic and one a bit harder. It was 65 minutes for both questions.
Interview questions [1]
Question 1
You are given an integer array arr of length n, and three integers x, y, and z.
You may select non-overlapping subarrays from arr.
Each chosen subarray must be of length 1, length 2, or length 3.
You can choose at most x subarrays of length 1.
You can choose at most y subarrays of length 2.
You can choose at most z subarrays of length 3.
Your goal is to maximize the total sum of all elements in the selected subarrays.
Return the maximum possible sum you can obtain under these constraints.
Input: arr (list of integers), x, y, z (non-negative integers)
Output: An integer representing the maximum total sum.
I applied online. I interviewed at Microsoft (Melbourne)
Interview
After submitting an online application, I received a HackerRank assessment after passing the resume screening stage, then I was rejected after completing the assessment and did not proceed to further interview rounds.
Interview questions [1]
Question 1
The assessment consisted of two LeetCode-medium-level coding questions to be completed within 75 minutes.
45 mins technical interview with a member of their San fran team. Very relaxed and informal but questions were focused and lots of follow ups. Easy to schedule as was over video conferencing platform
Straightforward technical loop overall, with strong interviewers at every stage. I genuinely enjoyed the in-depth conversations around technical challenges and algorithmic problem-solving — the entire process felt well-structured and genuinely engaging.