The interview process for the SWE Intern position was fairly structured and straightforward. It started with an online application, and after a short period I was contacted by a recruiter to schedule the first interview. The first round was a phone/virtual interview that focused mostly on basic technical questions and some behavioral questions about my experience, projects, and interest in the role.
After that, I moved on to a technical interview where I was asked to solve coding problems and explain my thought process step by step. The interviewer was mainly looking at problem-solving skills, understanding of data structures and algorithms, and how clearly I could communicate my approach. There were also a few follow-up questions to see how I would improve or optimize my solution.
Interview questions [1]
Question 1
One of the main questions they asked me was to solve a coding problem using data structures and explain my logic out loud while I was solving it. They also asked follow-up questions to see how I would optimize the solution.
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.