Software Engineer Intern applicants have rated the interview process at Microsoft with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 75% positive. To compare, the company-average is 66.3% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer Intern roles take an average of 30 days to get hired, when considering 155 user submitted interviews for this role. To compare, the hiring process at Microsoft overall takes an average of 30 days.
Common stages of the interview process at Microsoft as a Software Engineer Intern according to 155 Glassdoor interviews include:
One on one interview: 34%
Phone interview: 18%
Skills test: 17%
Presentation: 8%
Background check: 8%
Personality test: 6%
IQ intelligence test: 4%
Drug test: 3%
Group panel interview: 1%
Other: 1%
Here are the most commonly searched roles for interview reports -
First Round: Campus 1-on-1 interview
Second Round: 3 rounds of 1-on-1 interview with around 45mins each. Normally people hit to the second round will easily get the offer, but I didn't haha
Interview questions [1]
Question 1
leetcode easy and medium, and some behaviour questions
Process: 3 virtual interviews in a single day (75 minutes each) via MS Teams and HackerRank.
Overall Experience: Positive, highly technical, and deeply focused on data structures, optimization, and system design.
Interview questions [1]
Question 1
Round 1: Project & Architecture Review (75 mins)Focus: Deep dive into past technical experience.Details: The entire round was dedicated to presenting a personal/academic project. The interviewer asked detailed questions regarding the system's architecture, specific algorithmic choices, trade-offs, and design decisions.Round 2: Coding / Algorithms (75 mins)Focus: Problem-solving, bitwise operations, and array manipulation.Questions Asked:Bitwise Operation (LeetCode 2275 - Largest Combination With Bitwise AND Greater Than Zero): Given an array of integers, find the size of the largest subset where the bitwise AND of all elements is greater than zero. Insight: Count the number of set bits (1s) at each of the 32 bit positions across all numbers.Frequency Tracking (LeetCode 169 - Majority Element): Given an array, find the element that appears at least $n/2$ times (guaranteed to exist). Can be solved using a Hash Map ($O(n)$ space) or optimized using the Boyer-Moore Voting Algorithm ($O(1)$ space).Round 3: Low-Level Design (LLD) (75 mins)Focus: Object-Oriented Design (OOD) and data structure integration.Details: Design a parking lot system. The core challenge evolved into choosing the optimal combination of data structures to achieve $O(1)$ efficiency for parking, leaving, and tracking the physical index of each vehicle.Key Solution Concept: Integrating a Fixed-size Array (to maintain physical indices), a Doubly Linked List (to manage the pool of free spots), and a Hash Map (to map vehicle IDs to list nodes).
3 rounds of leetcode medium, 2 questions were very easy, the last one was really hard (it was a binary tree question). They asked about space and time complexity. In terms of structures it was straight forward but the question itself was hard
I applied online. I interviewed at Microsoft (Herzliya) in May 2026
Interview
3 online interviews, one and a half hours each, and two senior interviewers per interview. Must pass
an online code assessment beforehand. All 3 interviews were done in a two day timeframe.
Interview questions [1]
Question 1
uestions included reversing Linked List, implementing LRUCache, searching in a rotated sorted array