Microsoft SDE Intern Interview Guide: OA, Two Interview Rounds and What Was Asked
Prepare for Microsoft software engineer intern interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 15, 2026.
For students applying to Microsoft software engineering internships.
Built by the Codinzhub team from Microsoft intern interview experiences that candidates shared, including the ones posted on Codinzhub. Each experience is one person's interview, and Microsoft changes its process by year and campus, so use this as a map, not a promise.
The 30-second version. On campus in India, Microsoft runs an OA with two coding questions, then two interviews on the same day: a 45-minute coding round, then a round on projects, CS fundamentals and sometimes a debugging task or behavioral questions. Results often come the same night. Off campus, students applied on the careers portal in July and got the OA in September.
Round-by-round breakdown
Stage 1: Application, where candidates applied
How it works. Most interns came through campus drives: IIT BHU, IIT Delhi, IIT Guwahati, IIT Indore, IIT Madras, IIT Roorkee, IIT (ISM) Dhanbad, MNNIT, NIT Kurukshetra, IGDTUW, DTU and VIT Vellore in the experiences we read. Off campus, one candidate applied on the careers portal in July and got the OA link in September. A US candidate got an email when applications opened in the summer.
Stage 2: Shortlisting, how candidates moved forward
How it works. Shortlisting is by OA score. In one VIT drive, the final interview had 26 candidates. One off-campus candidate got the interview email 15 to 20 days after the OA; another got it 10 days later, with the interview two days after that.
Stage 3: Online assessment
At a glance
- Length: 60 to 120 minutes
- Questions per round: 2 coding questions
- What was asked: greedy with heaps, binary search, DP, graphs, sliding windows
- Most common: a DP question and a graph or map question
How it works. Two coding questions on online coding platform or a similar platform. Candidates at IIT BHU said almost everyone got different questions. One candidate solved both in half the time.
OA questions candidates reported:
| Question (our summary) | What it tests |
|---|---|
| Merge the array into one element at minimum total cost | Greedy with a heap |
| How many intervals contain each query point | Sorting, binary search |
| A graph problem with a queue, and a sliding-window, two-pointer problem | Graphs, sliding window |
| A DP problem and a hash map problem | DP, hashing |
Microsoft intern OA questions shared on Codinzhub:
| Question | Drive | Topic |
|---|---|---|
| Microsoft OA | IIT BHU | Mixed |
| Microsoft OA | IIT Indore | Mixed |
| Balance Chemical Equation | IIT (ISM) Dhanbad | Parsing |
| Plan Production | IIT Roorkee | Hard |
| Find Error Codes | IIT Roorkee | Strings |
More questions: Browse Microsoft questions.
Stage 4: The interview rounds
How it works. Two rounds, usually on the same day, about 45 to 60 minutes each, on Teams or Webex. Coding is done on online coding platform or CoderPad and you may have to run it on test cases. An HR call can come about an hour after round 1 if you pass.
Round 1
At a glance
- Length: 45 minutes (fixed slot)
- Questions per round: 1 or 2 coding problems, plus a few fundamentals questions
- What was asked: trees, heaps, binary search, strings, intervals
- Most common: tree problems; k pairs with the smallest or largest sums
Questions candidates reported:
| Question (our summary) | Follow-up reported |
|---|---|
| Find every valid date (DD-MM-YYYY, with / or -) in a string | Implementation heavy; explain every step |
| Print all nodes at distance K from a target in a binary tree | Write full code and print the output |
| K pairs with the largest sums from two sorted arrays | Heap without exploring every pair |
| Valid parentheses where * can be (, ) or empty; merge intervals | Second problem by logic only, for time |
| Pivot index in a rotated sorted array | Run it on test cases |
| Number of islands where each island's sum must be divisible by k | OOP questions: virtual, interfaces, abstract classes |
More questions: Browse Microsoft questions.
Round 2
At a glance
- Length: 25 to 60 minutes
- Questions per round: projects, fundamentals and 1 coding or debugging task
- What was asked: projects, OS, OOP, DBMS, debugging C++, behavioral
- Most common: a deep project discussion with OS questions
Questions candidates reported:
| Question (our summary) | What it tests |
|---|---|
| Debug a long C++ program that stores students' marks (about 15 bugs) | Reading code, C++ |
| Add each node's left-subtree sum to the node | Trees |
| Product of the last k numbers in a stream | Sliding window, queue |
| A linked-list hard problem and a string problem with many edge cases | Linked lists, strings |
Candidates were also asked about virtual memory, context switching, a stack problem, and why humans are needed if AI exists.
More questions: Browse Microsoft questions.
Stage 5: Result
How it works. Results often came the same night or within two days of the interviews. One VIT candidate saw the selected list two days later.
Microsoft intern experiences shared on Codinzhub
| College | Role and result | What was asked |
|---|---|---|
| IIT BHU | SDE intern, selected | OA: merge cost, intervals per query; R1: valid dates in a string; R2: debug a C++ student database |
| IIT Delhi | SDE intern, selected | Minimum platforms for trains; LRU cache; projects and HR questions in 60 minutes |
| IIT Guwahati | SDE intern | R1: two DSA problems and a resume grilling; R2: managerial and behavioral |
| IIT Guwahati | SDE intern, not selected | Two medium-hard DSA rounds; OOP and projects |
| MNNIT | SDE intern, not selected | Nodes at distance K; left-subtree sums; OOP, DBMS and OS |
The Codinzhub Next-Round Playbook
What Microsoft interns who moved on did. Put together by the Codinzhub team from the intern experiences in this guide.
To get past the OA
- Take timed contests often. One candidate said untimed practice did not help much for the real OA.
- Know greedy with a heap and binary search on sorted arrays well.
To get past Round 1
- Ask clarifying questions first, such as which date separators are allowed.
- Explain every step and check the interviewer is following.
- Practise tree problems where you print the full output.
To get past Round 2
- Know your projects deeply, especially any OS or systems project.
- Practise reading and debugging someone else's C++ code.
- Revise OS (virtual memory, context switching), OOP and DBMS.
FAQ
Is DP needed for a Microsoft internship?
It came up in the OA in several reports, and in interview round 1 for one VIT candidate.
Is there a behavioral round?
Sometimes. Round 2 can be managerial with behavioral questions.
About this guide
This guide is researched and written by the Codinzhub team. We read every Microsoft intern experience we could find, kept only what candidates actually described, and rewrote it in our own words. Questions are our own short summaries; the practice links point to similar problems, not the exact interview questions. Found something out of date? Share your own experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.