Microsoft SWE Intern Interviews: 244 Experiences (Part 1 of 6)

Shared by janebeingjane ·
Company
Microsoft
Reports
48 interview reports
Level
Internship
Stages
OA → Phone screen → Onsite

Microsoft SWE intern interviews in 2025–2026 depend on region: an OA first in India, two back-to-back rounds in the US, three in Israel and Europe.

At a glance

  • Process: in India, 38 of 66 reports mention an OA or timed coding screen first; in the US, 44 of 62 describe two interviews, often back to back; in Israel, 15 of 18 describe three interviews, often in one day, and 12 mention a home assignment or online test first; in Europe, 14 of 23 describe three.
  • Asked recently: résumé, project and past-internship questions in 99 of 232 reports and behavioral questions in 82. Among coding topics, arrays and hashing (52), strings (45), linked lists (33) and graphs (32) lead. LRU Cache was named in 8 reports and Valid Parentheses in 5.
  • Difficulty: interviewers often changed the rules partway, taking away hash maps (102) or Python's dict (223); four loops had little or no coding and still ended in offers (06, 14, 17, 179).
  • Practise first: LRU Cache, Valid Parentheses and, for Israel, Map with O(1) get, set and setAll.

Coverage: Internship cohort. This part covers the Software Engineering Intern role (SWE intern, SDE intern, summer and off-cycle intern titles), reports 01–48, dated July 2 to November 9, 2026. Locations: India 19, US 14, not stated 8, Serbia 2, and one each from China, the Czech Republic, Egypt, Israel and Mexico. Stages: OA, phone and recruiter screens, interview rounds and finals. The summary, question tables and regional notes below cover all 232 Software Engineering Intern reports in Parts 1–5 (January 2025 to November 2026). Most dates are report dates; interview dates are used where a report gives one.

In this series

  • Part 1 (current): Software Engineering Intern reports 01–48, July to November 2026. Also has the overview, question tables, regional notes and patterns for all 232 Software Engineering Intern reports.
  • Part 2: Software Engineering Intern reports 49–102, January to June 2026.
  • Part 3: Software Engineering Intern reports 103–149, October to December 2025.
  • Part 4: Software Engineering Intern reports 150–191, July to September 2025.
  • Part 5: Software Engineering Intern reports 192–232, January to June 2025 (plus one dated only to 2025).
  • Part 6: The other internship programs: Explore Intern (1 report), Student Software Engineer roles in Israel and Denmark (10) and one SWE Co-op (1).

What came up

Across all 232 Software Engineering Intern reports, interviewers spent more time on the candidate than on any single algorithm topic: resume, project and past-internship questions showed up in 99 reports and behavioral or motivation questions in 82. Among coding topics, arrays and hashing (52) and strings (45) led, and linked lists (33) came up slightly more often than graphs (32) or trees (29).

Topic Reports Last seen
Resume, project and past-internship deep dives 99 of 232 Nov 2026 (report date)
Behavioral and motivation questions 82 of 232 Oct 2026 (report date)
Arrays and hashing 52 of 232 Nov 2026 (report date)
CS fundamentals (OS, OOP, DBMS, networks) 47 of 232 Nov 2026 (report date)
Strings 45 of 232 Oct 2026 (report date)
Linked lists 33 of 232 Sep 2026 (report date)
Graphs, BFS/DFS and dependency ordering 32 of 232 Nov 2026 (report date)
Dynamic programming 30 of 232 Nov 2026 (report date)
Trees, BSTs and tries 29 of 232 Oct 2026 (report date)
Design a data structure or class (LRU, trie, setAll, hash map) 27 of 232 Oct 2026 (report date)
System and low-level design 26 of 232 Oct 2026 (report date)
Stacks, queues and heaps 21 of 232 Oct 2026 (report date)
Sliding window and two pointers 20 of 232 Oct 2026 (report date)
Math, bits and puzzles 16 of 232 Nov 2026 (report date)
Binary search 15 of 232 Nov 2026 (report date)
Grids and matrices 14 of 232 Nov 2026 (report date)
Greedy and backtracking 13 of 232 Sep 2026 (report date)

A report can sit in several rows, and a topic a report doesn't mention isn't evidence it never came up. Many reports give only a difficulty, such as medium, without the topic.

Questions we found

These tables cover all 232 Software Engineering Intern reports. Each question type has its own table. LRU Cache was the most repeated named problem (8 reports), followed by Valid Parentheses and reversing a linked list (5 each).

Algorithms / Data Structures

Question Reports Last seen
Flip one-way roads so every city reaches city 0 2 reports (possibly one candidate) Reports: 2025-01-02 (OA date); Additional FastPrep history: 2024-07-24
LRU Cache 8: 26, 42, 52, 69, 106, 195, 209, 230 Sep 2026 (report date)
Valid Parentheses 5: 30, 35, 121, 189, 229 Aug 2026
Reverse a linked list 5: 39, 52, 71, 169, 214 Jul 2026 (report date)
Map with O(1) get, set and setAll 4: 55, 116, 206, 229 Jun 2026
Implement a queue using stacks 3: 40, 211, 218 Jul 2026 (report date)
Climbing Stairs 3: 56, 179, 189 Jun 2026 (report date)
Longest Substring Without Repeating Characters 2: 07, 27 Oct 2026
Implement a trie 2: 23, 114 Sep 2026
Majority Element 2: 46, 53 Jul 2026 (report date)
Binary tree zigzag level-order traversal 2: 76, 91 Mar 2026 (report date)
Count battleships on a board 2: 84, 171 Feb 2026
Reverse Nodes in k-Group 2: 112, 166 Dec 2025
Maximize the strength sum with one-time adjacent swaps 2: 158, 170 Sep 2025
Pick a batch size that keeps total processing steps under a limit 1: 01 Nov 2026
Count how often a user did an action, from an event log 1: 01 Nov 2026
Rotting-oranges style grid BFS 1: 02 Nov 2026 (report date)
Count subarrays with as many even as odd numbers 1: 02 Nov 2026
Most items bought on a budget, walking right from a start position 1: 05 Oct 2026
Set Matrix Zeroes 1: 07 Oct 2026
Implement a stack 1: 08 Oct 2026
Group Anagrams 1: 08 Oct 2026 (report date)
Word Search 1: 16 Sep 2026
Racer finish-order pairs: valid, complete, first and last 1: 16 Sep 2026
Minimum cost after inserting one value 1: 16 Sep 2026
Asteroid Collision 1: 16 Sep 2026
Delete and Earn (renamed maximize score) 1: 22 Sep 2026 (report date)
Count Binary Substrings 1: 22 Sep 2026
Longest substring with at most K distinct characters 1: 24 Sep 2026
Sort the words of a sentence by length 1: 25 Sep 2026
Most non-overlapping intervals you can keep 1: 26 Sep 2026
String to integer (atoi-style parsing) 1: 33 Aug 2026
Minimum Window Substring 1: 35 Jul 2026
Trapping Rain Water 1: 39 Jul 2026
Answer queries over the last k elements of a stream with a deque 1: 39 Jul 2026
Simulate FCFS, SJF and Round Robin scheduling 1: 43 Jul 2026
Count collisions for one ball on a line 1: 44 Jul 2026
Two Sum 1: 45 Jul 2026
Remove a node from a linked list 1: 45 Jul 2026
Sort data that does not fit in memory 1: 47 Jul 2026
Palindrome number without converting to a string 1: 48 Jul 2026
Word Break II (all sentences) 1: 50 Jun 2026 (report date)
Split an array into K groups to minimize the largest sum 1: 51 Jun 2026 (report date)
Search in Rotated Sorted Array 1: 52 Jun 2026 (report date)
Largest combination with bitwise AND above zero 1: 53 Jun 2026
Binary tree level-order traversal 1: 54 Jun 2026
Smallest difference between any two numbers 1: 57 May 2026
Rotate one array by the values of another 1: 58 May 2026
Merge Intervals 1: 60 May 2026 (report date)
Longest Valid Parentheses 1: 63 May 2026
Find All Anagrams in a String 1: 65 Apr 2026
Palindrome linked list 1: 70 Mar 2026 (report date)
Do two rectangles overlap? 1: 78 Mar 2026
All pairs with the minimum difference 1: 78 Mar 2026 (report date)
Redundant Connection 1: 80 Mar 2026
Pick songs that fill a time window as fully as possible 1: 82 Mar 2026
Add Binary 1: 89 Jan 2026
Valid Sudoku 1: 92 Jan 2026
Multiply two integers without the * operator 1: 93 Jan 2026
Is this array a BST postorder traversal? 1: 94 Jan 2026
Mean, median and mode of a stream 1: 97 Jan 2026
Users-and-groups membership structure 1: 102 Jan 2026
Keep unique elements with no extra data structure 1 Jan 2026
Validate Binary Search Tree 1: 113 Dec 2025
Integer square root 1: 113 Dec 2025
Longest Increasing Subsequence 1: 114 Dec 2025 (report date)
Longest buy-to-sell span with a profit 1: 119 Nov 2025
Find Peak Element 1: 121 Nov 2025
Sort a list with no extra memory, then explain quicksort 1 Nov 2025
Implement malloc and free over a fixed buffer 1: 124 Nov 2025
Minimum-cost path through a grid 1: 129 Nov 2025
Isomorphic Strings 1: 132 Nov 2025 (report date)
Minimum Size Subarray Sum 1: 134 Oct 2025
Implement Dijkstra's algorithm from scratch 1: 137 Oct 2025
Top K Frequent Elements 1: 146 Oct 2025 (report date)
Longest Common Subsequence 1: 145 Oct 2025
Check whether a number is divisible by 5 1: 141 Oct 2025
Union of two arrays 1: 151 Sep 2025
Implement a linked list from scratch 1 Sep 2025
Contains Duplicate 1: 154 Sep 2025
Cut the sticks 1: 158 Sep 2025
Implement quicksort 1: 160 Sep 2025
Rotate a matrix 90 degrees 1: 161 Sep 2025
Remove redundant task-dependency edges 1: 161 Sep 2025
Combination Sum 1: 161 Sep 2025
Split a string by a character, substring or regex 1: 163 Sep 2025
Best Time to Buy and Sell Stock 1: 165 Sep 2025
Longest Palindromic Substring 1: 167 Aug 2025
Most frequent character in a string 1: 168 Aug 2025
All endpoints of a tree diameter 1 Aug 2025
Make grid columns strictly increasing at minimum cost 1: 170 Aug 2025
Smallest prime at or above a number 1: 174 Aug 2025
Merge two sorted linked lists 1: 175 Aug 2025
Inorder successor in a BST 1: 176 Aug 2025
Implement a binary tree 1: 175 Aug 2025
Course Schedule 1: 178 Jul 2025 (report date)
OA DP problem modeled on 0/1 knapsack 1: 179 Jul 2025
Find every anagram of a word in a dictionary 1: 181 Jul 2025 (report date)
Digital root of a numeric string in O(1) 1: 184 Jul 2025
Text editor with insert, delete and backspace 1: 188 Jul 2025
Stack that also tracks its middle element 1: 189 Jul 2025
Palindrome check in O(1) space 1: 189 Jul 2025
Kth Largest Element in an Array 1: 191 Jul 2025
Word Ladder 1: 193 May 2025
Check that every node equals its subtree sum 1: 193 May 2025
Valid Anagram 1: 195 May 2025
Shortest Bridge 1: 198 May 2025
Task chain balancer (OA task) 1 Apr 2025
Equalize server latency (OA task) 1: 200 Apr 2025
Convert a float to a string without built-ins 1: 202 Apr 2025
Match a string against a pattern 1: 213 Mar 2025
Find the upstream tasks behind a failure 1: 213 Mar 2025
Open the Lock 1: 214 Mar 2025
Number of Islands 1: 216 Mar 2025 (report date)
Gas Station 1: 214 Mar 2025
Exclusive Time of Functions 1: 215 Mar 2025
K-length fragment (OA task) 1 Feb 2025
Height skyscraper (OA task) 1: 220 Feb 2025 (report date)
Implement a self-balancing BST 1: 224 Jan 2025
Serialize and Deserialize Binary Tree 1: 226 Jan 2025
Implement DFS on a graph 1 Jan 2025
Metro fare with a daily cap 1: 227 Jan 2025
Permutation in String 1: 229 Jan 2025
Intersection of two linked lists 1: 229 Jan 2025 (report date)
Find Pivot Index 1: 229 Jan 2025
Write your own hash map class with O(1) operations 1: 223 early 2025
Two-player pick game where an even pick reverses the rest 1: 232 2025
OA problem similar to House Robber 1: 232 2025

Multiple choice (OA)

Question Reports Last seen
Multiple-choice set: OOP keywords, limited-memory search, cache eviction, stock-price range queries, age validation 1 Apr 2025

Low-Level Design (LLD/OOD)

Question Reports Last seen
Design a simple bank account class 1: 23 Sep 2026
Design a parking lot with O(1) park and leave 1 Jun 2026
Design a smart elevator 1: 86 Feb 2026
Design a stock market system in Python 1 Dec 2025
Design tic-tac-toe 1 Aug 2025
Design a file system and find a file's path 1: 226 Jan 2025

System Design

Question Reports Last seen
Scale a system to 30,000, 50,000 and 1 million users; API design basics 1: 20 Sep 2026
Speed up a 500 ms database call 1 Mar 2026
Avoid serving stale cache data when the data updates every 5 minutes 1 Mar 2026
Design an inventory management system 1: 175 Aug 2025
Design a scalable file storage service 1: 204 Apr 2025
Design Snap Lens Studio end to end 1: 223 early 2025

Behavioral (BQ)

Question Reports Last seen
Tell me about yourself 8: 28, 66, 88, 131, 159, 194, 202, 205 Aug 2026
Why Microsoft? / Why do you want to join Microsoft? (practice) 6: 40, 66, 122, 139, 165, 193 Jul 2026 (report date)
A technical challenge, or the hardest problem you solved (practice) 4: 75, 131, 140, 212 Mar 2026 (report date)
Tell me about a failure / how do you handle failure? (practice) 2: 40, 73 Jul 2026
Pick a finished project: one thing you would change, one thing you would add 1: 06 Oct 2026
Which AI tools do you use while programming? (practice) 1: 29 Aug 2026
How do you approach learning a new skill? (practice) 1: 40 Jul 2026
How do you handle a conflict at work? (practice) 1: 49 Jun 2026
What do you think about using AI? (practice) 1: 76 Mar 2026
How do you react to criticism? (practice) 1: 76 Mar 2026 (report date)
Strengths and weaknesses (practice) 1: 78 Mar 2026
A time you worked with engineers to fix a technical issue (practice) 1: 80 Mar 2026
How would you handle refactoring a pull request? (practice) 1: 83 Feb 2026
How do you handle errors? (practice) 1: 83 Feb 2026
How do you decide when you have several possible solutions? (practice) 1: 83 Feb 2026
How do you debug? (practice) 1: 83 Feb 2026
Security and testing, discussed in depth (practice) 1: 85 Feb 2026
Your favorite accomplishment (practice) 1: 88 Jan 2026
How did you deal with a bad team member? (practice) 1: 99 Jan 2026
A time you disagreed with a teammate (practice) 1: 104 Dec 2025 (report date)
Your most impactful project (practice) 1: 105 Dec 2025
Which CS fundamentals interest you most? (practice) 1: 107 Dec 2025
A time you worked remotely on something (practice) 1: 117 Nov 2025
A challenge you faced working in a team (practice) 1: 125 Nov 2025
Something negative you have done (practice) 1: 131 Nov 2025
What would you like to work on? 1: 165 Sep 2025
What was your favorite class in college? 1: 165 Sep 2025
A time you helped debug something in the frontend or backend 1: 164 Sep 2025
What did a past project failure teach you? (practice) 1: 179 Jul 2025
How do you build collaboration in a team? (practice) 1: 179 Jul 2025
A 24-hour deadline collides with a critical bug (practice) 1: 179 Jul 2025
Do you use competitive programming sites? 1 Jul 2025
Your favorite Microsoft product (practice) 1: 192 Jun 2025
Your most memorable college experiences (practice) 1: 193 May 2025
Front-end, back-end or algorithms? (practice) 1: 212 Mar 2025
Why a SWE job rather than an AI job? 1: 217 Mar 2025
A past internship project you found hard 1: 217 Mar 2025

CS fundamentals (concept questions)

Question Reports Last seen
OOP principles (the four pillars) 5 Aug 2026
Explain recursion to a child or a non-technical person 2 Jul 2026
Arrays vs. linked lists 2 Jan 2026
Hybrid search, BM25 and keyword retrieval (from a RAG project) 1: 01 Nov 2026
Array vs. vector 1: 36 Jul 2026
Linear search vs. binary search 1 May 2026
What a linked list, a BST and an in-order traversal are 1 Mar 2026
How would you make your system crash with code? 1 Mar 2026
How a hash map keeps keys unique 1 Jan 2026
How do you represent a negative number in binary? 1 Dec 2025
How a doubly linked list works 1 Dec 2025
How sift-up works in a heap 1 Dec 2025
Java vs. C++ vs. C 1 Nov 2025
Stack vs. queue 1 Nov 2025
Unit tests, black-box vs. white-box testing 1 Nov 2025
What happens when you type a URL into a browser? 1: 175 Aug 2025

Puzzles

Question Reports Last seen
Three switches and three bulbs 1 Mar 2026
100 doors puzzle 1: 78 Mar 2026

Other

Question Reports Last seen
Design an A/B test 1 Sep 2025

How the first stage differs by region

These sections count what the reports mention. Many reports skip early stages, so a missing OA in a report is not proof there wasn't one.

India mostly opens with an OA, often through a campus drive

Reports: 66 from India · Dates: January 2025 to October 2026, plus one dated only to 2025

  1. 38 of the 66 mention an OA or a timed coding screen before any interview.
  2. 31 came through a campus or university channel.
  3. After the OA, the reports describe one or two technical rounds. 10 add a separate HR round, and several have a manager round.
  4. HackerRank is named in 7 of the India reports, for the OA or for live coding.

This is a synthesis of 66 reports.


US loops are usually two interviews, often back to back

Reports: 62 from the US · Dates: January 2025 to November 2026

  1. 44 of the 62 describe two interviews after any OA or screen. 22 call them back-to-back, and 14 mention 45-minute rounds.
  2. 21 mention an OA. Four candidates say they were moved straight to the final round (117, 125, 159, 178).
  3. 5 mention a phone or recruiter screen.
  4. Three describe three interviews, and one (152) had five onsite rounds, including an unprepared project presentation.

This is a synthesis of 62 reports.


Israel runs a home assignment, then a day of three interviews

Reports: 18 Software Engineering Intern reports from Israel (the student roles are in Part 6) · Dates: January 2025 to July 2026

  1. 12 of the 18 mention a home exam, take-home or online test first.
  2. 15 describe three interviews. 10 say they were on one day or within two days, and 6 mention 75- or 90-minute sessions.
  3. The same O(1) setAll data structure came up in 4 of these reports (55, 116, 206, 229).

This is a synthesis of 18 reports.


Europe pairs an online test with three interviews

Reports: 23 from Serbia (7), Romania (6), Ireland (4) and one each from the Czech Republic, Norway, France, Denmark, Spain and the UK · Dates: February 2025 to July 2026

  1. 18 of the 23 mention an OA, online test or home assessment. All 7 from Serbia do.
  2. 14 describe three interviews, often 45 minutes each with a short behavioral or CV opening.

This is a synthesis of 23 reports.


China reports had no OA; the first round was a live coding interview

Reports: 7 from China · Dates: March 2025 to November 2026

  1. None of the seven mentions an OA. Each starts with a live interview that includes coding.
  2. Report 211 says everyone in its cycle went through one pooled first round before being matched to a team direction.
  3. In two reports a single final round followed round 1. One had three rounds, and one had five interviews across two teams.

48 detailed candidate timelines, loops, and screens

01: Backend summer intern, China — batch-size search and an event-count API

Report date: 2026-11-09 · Role: Summer intern, backend software engineering · Location: China (city not stated) · Result: Not selected

First interview (the candidate found it fairly easy)

  1. Walked through an AI ad-generation pipeline from a past internship and sketched it on a whiteboard. Follow-ups: how pipeline assets were made reusable, what exactly got optimized, what they had contributed to the Valkey open-source project, and why they decoupled an RDMA component and what went wrong.
  2. Coding: pick a batch size that keeps total processing steps under a limit. With batch size b, an element x takes ceil(x / b) steps, so [1, 3, 5, 5] with b = 4 costs 1, 1, 2, 2. The candidate's own wording of the goal is a little inconsistent (smallest count vs. largest batch size). They binary-searched on the batch size and had one bug: the lower bound started at 0 instead of 1.

Second interview (much more drilling)

  1. A chain of retrieval questions from their RAG work: what hybrid search is, why not use semantic search alone, how keyword retrieval works, what BM25 is, and why a rare term can still score high.
  2. Redis over RDMA: why they built it, how dynamic loading worked, and how they showed it was reliable.
  3. Coding: given event lines made of an event id, a user id and an action, build a production-ready interface that returns how many times a user did a given action. They filled a nested map (user → action → count) in one pass but didn't finish. The interviewer then asked whether a global variable was a good home for that map, and the candidate agreed it wasn't thread-safe.

02: Recruiter-sourced intern — even-odd subarrays and a rotting-oranges BFS

Report date: about 2026-11-06 (approximate) · Role: Software engineering intern · Location: Not stated · Channel: Recruiter · Result: Passed

Coding round (2 problems)

  1. Count the subarrays that hold as many even numbers as odd numbers.
  2. A grid BFS in the style of rotting oranges.

Resume round

  1. Specific projects and points on the resume, down to which function they had used in a given spot.

03: Redmond — OA, then two back-to-back coding rounds

Report date: 2026-11-02 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Online assessment (no details)

Two back-to-back technical interviews (algorithm coding)

  1. One problem the candidate called an odd, system-design-flavored question.
  2. A medium coding problem.
  3. A math / dynamic programming problem.

The report doesn't say which of these landed in which interview.


04: OA only — a sliding window and a design-style problem

Report date: 2026-10-26 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: No offer

Online assessment (2 questions; a 10-day window to start it)

  1. A sliding-window problem at about medium difficulty.
  2. A design-style problem the candidate rated hard and called a system design problem.

No interview followed.


05: India SWE intern — budget queries over a row of prices

Report date: 2026-10-21 · Role: SWE Intern · Location: India · Result: Not stated

The report shares one problem and asks for help with it. It doesn't say which round it came from.

  1. Most items bought on a budget, walking right from a start position. Prices sit in a row in non-decreasing order. Each query gives a start position and a budget. The shopper passes every cubicle from there to the end, can buy at most one item per cubicle, and wants as many items as the budget allows. Up to 100,000 prices and 100,000 queries; prices up to 100,000.
  2. Part two: the same question when the prices are not sorted.

06: Redmond — two interviews and no coding problems at all

Report date: 2026-10-20 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Online assessment (HackerRank)

Two back-to-back virtual interviews with engineers

  1. How they think as an engineer, plus their projects and earlier internships. Neither interview had a coding problem.
  2. Pick a project you finished: what's one thing you wish you'd changed along the way, and one thing you'd add now?

07: Hyderabad campus — two named problems in two rounds

Report date: 2026-10-18 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: Offer

Online assessment (2 questions)

Technical round 1 (on HackerRank)

  1. Resume questions.
  2. Longest Substring Without Repeating Characters.

Round 2

  1. Set Matrix Zeroes.

The whole process took one day.


08: Raipur campus drive — projects, a stack that wouldn't run, and Group Anagrams

Report date: 2026-10-13 · Role: Software Engineer (Internship) · Location: Raipur, India · Channel: On campus · Result: No offer

Online assessment (2 questions): a medium string problem and a medium knapsack-style DP problem.

Technical round 1

  1. Intro, then resume projects. For a chat app: how WebSockets work and how they differ from HTTP. Also asked whether they had done any AI work.
  2. One sliding-window problem.

Technical round 2

  1. More project questions, including user and IT-support angles the candidate couldn't answer well.
  2. Implement a stack. The code didn't run and there was no time left to debug.
  3. Group Anagrams. They didn't reach the optimal solution.

Microsoft visited the campus and hired 15–16 interns that cycle. Looking back, the candidate wished they had revised basics instead of spending all their prep on graphs and DP.


09: Redmond — one interview, and you build your own test tree

Report date: 2026-10-12 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Interview (virtual)

  1. General behavioral questions to open.
  2. Basic algorithm questions. The candidate also had to build a binary tree and edge-case tests to check their own solution.

The process took about two weeks.


10: University channel — easy-to-medium OA, two resume-heavy rounds

Report date: 2026-10-09 · Role: Software Engineer (Internship) · Location: Not stated · Channel: University channel · Result: No offer

Online assessment (60 minutes, 2 problems, easy to medium)

Technical rounds 1 and 2

  1. Resume questions and DSA concepts in both rounds.

11: Hyderabad — two DSA rounds, the second with a manager

Report date: 2026-10-08 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: University channel · Result: Offer

Round 1, DSA (2 problems)

  1. A medium binary-search problem.
  2. A medium tree problem.

Round 2, DSA with a manager

  1. A hard binary-tree problem.
  2. A CV walk-through, then an open conversation about AI.

Done in a single day.


12: Redmond — a light OA, then two same-day interviews

Report date: 2026-10-05 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Online assessment (HackerRank, 2 problems, easy to easy-medium)

Two technical interviews on the same day, each with a different interviewer (no question details).

The process took about four weeks.


13: Superday — two coding rounds and a discussion

Report date: 2026-10-02 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Online assessment (no details)

Superday, about a month after the OA, three 45-minute interviews:

  1. Algorithm coding.
  2. Algorithm coding.
  3. A discussion round with technical questions and questions about past experience.

14: Redmond — one behavioral, one design-style round

Report date: 2026-09-27 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Two back-to-back virtual interviews

  1. Behavioral: deep questions on past internships and projects.
  2. Technical: a medium-to-hard design-style coding question.

The candidate noted that both rounds are usually algorithm coding and that their split was unusual.


15: Redmond — one problem per interview, then follow-ups

Report date: 2026-09-27 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: No offer

Online assessment (online coding)

Two back-to-back virtual interviews

  1. Each opened with behavioral questions about previous projects and teamwork.
  2. Each had one coding problem, easy to medium, followed by questions on complexity and how to improve it.

16: India on-campus — OA done in 16 minutes, then a racer-ordering puzzle

Report date: 2026-09-17 · Role: SWE Intern (on-campus) · Location: India · Result: Offer

Shortlist and OA (resume and CGPA shortlist; 75 minutes, 2 questions; sets differed between candidates)

  1. Minimum cost after inserting one value: an array's cost is the sum of squared differences between neighbors. Insert exactly one value anywhere and return the smallest possible cost.
  2. Asteroid Collision.

Both were done in 16 minutes. The interview invite came three days later.

Round 1, DSA (virtual; the interviewer joined 20–25 minutes late, so about 25 minutes were used)

  1. Word Search. The candidate asked clarifying questions, explained the plan, coded while checking in, and walked through an edge case. Tough follow-ups came after (not described). Positive feedback, and the next link arrived 20 minutes later.

Round 2, with a Principal Engineer

  1. Area of interest, then about 10 minutes on one project.
  2. Racer finish-order pairs: each tuple says one racer finished ahead of another. Is the data valid? Is it complete? Who finished first and last? The prompt was deliberately thin, and the candidate had to restate it. They solved the first and third parts. On completeness they cycled through correct but slow ideas, went quiet for about two minutes, and came back with a simpler one. The interviewer had asked them not to talk while coding and said the round was about thinking, not code.

Offer the next day.


17: Redmond — short coding, long culture-fit talk

Report date: 2026-09-17 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Virtual interviews

  1. Two coding questions, easy to medium, about 20 minutes each.
  2. Most of the time went to behavioral and culture-fit questions.

18: Bengaluru campus — stacks, stacks and one more stack

Report date: 2026-09-12 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: On campus · Result: Offer

Online assessment (HackerRank, 1 problem): a simple array and priority-queue problem.

Technical round 1

  1. Self-introduction, then two stack problems.

Technical round 2

  1. Self-introduction, resume and projects.
  2. One more stack problem.

About four weeks end to end.


19: Redmond — three 45-minute virtual onsites

Report date: 2026-09-12 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Online assessment (2 problems, one medium and one medium-to-hard)

Three back-to-back virtual onsites (45 minutes each)

  1. The rounds mixed behavioral questions, easy coding questions and high-level system design. The report doesn't split them by round.

About four weeks end to end.


20: Hyderabad campus — binary search, grid DFS, then the whole resume

Report date: 2026-09-08 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: Offer

Online assessment (no details)

Technical round

  1. A fairly easy binary-search problem.
  2. A fairly easy DFS on a grid.

Manager round

  1. The entire resume, start to finish.

21: Bengaluru off-campus — HLD and LLD in round 2

Report date: 2026-09-08 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: Applied online · Result: Offer

Online assessment (HackerRank, 2 word-problem style questions in a competitive-programming flavor)

  1. A string-manipulation problem (the candidate rated it 2 out of 5).
  2. A problem that used a priority queue (3 out of 5).

Round 2: resume, HLD and LLD

  1. A standard low-level design task (not named).
  2. High-level design basics: how scaling works, what an API is, how you'd scale a system for 30,000, 50,000 and then 1 million users, and good API design habits.

Round 3: CS fundamentals and DSA

  1. Computer science fundamentals.
  2. A basic-looking problem whose clean solution was a tricky merge-intervals idea.

About two months from application to offer.


22: OA with two well-known problems under new names

Report date: 2026-09-08 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Passed the OA

Online assessment (75 minutes, 2 problems, both familiar problems with new names)

  1. Count Binary Substrings.
  2. A maximize-score task that is Delete and Earn.

23: Three 45-minute interviews — behavioral, OOP, algorithms

Report date: 2026-09-06 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Interview 1, behavioral (45 minutes)

Interview 2, OOP (45 minutes)

  1. Design a simple bank account class.

Interview 3, algorithms (45 minutes)

  1. Implement a trie.

Questions from other subjects, such as operating systems, also came up.


24: Hyderabad campus — OA, one technical round, one HR round

Report date: 2026-09-06 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: Offer

Online assessment (2 questions)

  1. Longest substring with at most K distinct characters.
  2. Another medium array problem.

Technical interview

  1. Simple linked-list work: fast and slow pointers, and reversal.
  2. Bit manipulation: set and clear the last bit, masking.
  3. Basic operating-systems questions.

HR round

  1. Previous internships.

All in one day.


25: Redmond — a DSA round that was really about class design

Report date: 2026-09-05 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Online assessment (HackerRank)

Two back-to-back technical interviews

  1. Sort the words of a sentence by length. The interviewer cared about how the classes were designed, not just the sort.

The offer call came three weeks later.


26: Bengaluru university channel — fundamentals, LRU cache, interval scheduling

Report date: 2026-09-03 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: University channel · Result: No offer

Interview (the report doesn't give a round count)

  1. OOP, computer networks, DBMS and other fundamentals.
  2. LRU Cache.
  3. An interval scheduling problem (most non-overlapping intervals you can keep).

27: Bengaluru — out after round 1

Report date: 2026-09-01 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: University channel · Result: No offer

Online assessment (HackerRank, 2 medium-to-hard problems)

Interview round 1

  1. Longest Substring Without Repeating Characters.
  2. Projects and why they made the choices they did.

Rejected after the first of two rounds.


28: Redmond — two org engineers and a medium coding problem

Report date: 2026-08-31 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Online assessment (2 questions)

Two interviews with engineers from the org

  1. Tell me about yourself.
  2. A medium coding problem.

29: Bengaluru campus — a tree DP, then AI tools with the hiring manager

Report date: 2026-08-31 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: On campus · Result: Offer

Round 1, DSA

  1. One medium-to-hard tree DP problem.

Round 2, hiring manager

  1. A deep dive on the resume and projects.
  2. Which AI tools they use while programming.

Done in one day.


30: Redmond — OA, then a behavioral final and a bracket check

Report date: 2026-08-18 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Online assessment (easy to medium)

Final, behavioral

  1. Standard behavioral questions, resume follow-ups and some technical questions.

Final, technical

  1. Valid Parentheses: given a string of ( ) [ ] { }, say whether every opener is closed by the right closer.

The offer came about two weeks after the final.


31: Mumbai campus — string problems, then a resume round

Report date: 2026-08-10 · Role: Software Engineer (Internship) · Location: Mumbai, India · Channel: University channel · Result: Offer

Round 1, DSA (online, 2 problems)

  1. A simple string problem with a frequency map.
  2. A recursive or stack-based string problem.

Round 2, DSA and resume (online)

  1. One DSA problem (not named).
  2. Resume questions.

The candidate got the offer and declined it.


32: Hyderabad — OA, technical round, HR round

Report date: 2026-08-08 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Result: Offer

Online assessment (2 medium questions)

Technical round

  1. A string problem that fit a sliding window.
  2. OOP, OS and DBMS fundamentals.
  3. Deep questions on resume projects.

HR round

  1. Projects and scenario-based questions.

33: Hyderabad campus — a grid problem and an atoi-style parser

Report date: 2026-08-04 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: Offer

Online assessment (no details)

Technical round 1 (1 problem)

  1. A medium-to-hard matrix / grid problem.

Technical round 2 (1 problem)

  1. A string-to-integer parsing problem, similar to String to Integer (atoi). They were expected to dry-run it, list test cases and edge cases, and explain their reasoning.

DBMS, operating systems, the four pillars of OOP, and why they picked the tools in their projects also came up. About a week end to end.


34: Redmond — a hard linked-list design round, then an easy one

Report date: 2026-08-01 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: No offer

Online assessment in August, interviews about a month later.

Interview 1 (the candidate found it hard)

  1. A design question built on a linked list.

Interview 2 (easy)

  1. A light behavioral part.

35: Raipur campus — four problems in the first interview

Report date: 2026-07-31 · Role: Software Engineering Intern · Location: Raipur, India · Channel: On campus · Result: Offer

Online assessment (2 standard DSA problems, done in 20–30 minutes)

Technical interview 1 (4 problems; two are named)

  1. Valid Parentheses.
  2. Minimum Window Substring.

Technical interview 2

  1. A backtracking problem.

Three days from start to offer.


36: Cairo — binary search, a graph, and arrays vs. vectors

Report date: 2026-07-29 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Result: No offer

Online assessment (no details)

Live coding 1

  1. A medium binary-search problem.

Live coding 2

  1. A graph problem.

They were also asked how an array differs from a vector.


37: Belgrade — a resource-split task where slow code timed out

Report date: 2026-07-28 · Role: Software Engineer (Internship) · Location: Belgrade, Serbia · Result: No offer

Coding assessment (hidden tests with time limits; the stage isn't named)

  1. A resource-allocation scenario: find the best way to split a shared resource. Unoptimized code timed out on the last test cases.

38: Bengaluru campus — one short interview

Report date: 2026-07-27 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: On campus · Result: Offer

Technical interview (on campus, under 45 minutes)

  1. A past project from the CV.
  2. An array / string sorting problem.

39: Belgrade — three team interviews, from easy to Trapping Rain Water

Report date: 2026-07-22 · Role: Software Engineer (Internship) · Location: Belgrade, Serbia · Channel: Applied online · Result: Offer

Home assessment (HackerRank, 2 tasks at about medium difficulty)

Three 45-minute interviews, each with an engineer from the team. Each opened with CV, interests and personal questions, then one problem:

  1. Reverse a linked list in place (easy).
  2. Trapping Rain Water (hard).
  3. Read a stream of data and use a deque to answer queries over the last k elements (easy to medium).

Selection after applying took about two months; the whole process about three.


40: Prague — three coding-plus-behavioral rounds

Report date: 2026-07-21 · Role: Software Engineer (Internship) · Location: Prague, Czech Republic · Channel: Applied online · Result: No offer

Online assessment (no details)

Three rounds of live coding plus behavioral (on HackerRank). Across the rounds:

  1. Why Microsoft?
  2. Tell me about a failure.
  3. How do you approach learning a new skill?
  4. Implement a queue using two stacks.
  5. Find an efficient way to filter an array.
  6. Theory on data structures and time complexity.

41: Two rounds, two mediums, lots of background questions

Report date: 2026-07-21 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Technical rounds 1 and 2 (one problem each)

  1. Two medium coding problems across the two rounds (not named).
  2. Many questions about their background and past experiences. The candidate's tip was to have stories ready instead of rushing answers.

42: Tel Aviv — take-home, three interviews, and an LRU cache

Report date: 2026-07-20 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Channel: Applied online · Result: No offer

Take-home assignment

Three interviews

  1. One of them asked for a data structure that meets the rules of an LRU cache.

About two months end to end.


43: Bengaluru campus — a counting DP, then CPU scheduling in code

Report date: 2026-07-15 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: On campus · Result: No offer

Round 1 (1 problem)

  1. A simple 1D DP counting problem (number of ways).

Round 2 (1 problem)

  1. Implement CPU scheduling: FCFS, SJF and Round Robin.

44: Bengaluru — a ball-collision count and a greedy sort

Report date: 2026-07-14 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Result: No offer

Technical screen (coding, 2 problems; the candidate rated them easy to medium)

  1. Balls on a line with speeds: how many collisions does ball x take part in? A faster ball behind x hits x, and x hits any slower ball ahead of it.
  2. Sort an array cleverly to maximize a weighted sum (greedy).

45: Redmond — recruiter screen, then Two Sum and linked lists

Report date: 2026-07-11 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Phone screen with a non-technical recruiter

  1. STAR-format behavioral questions plus light technical ones.
  2. Explain recursion to a five-year-old.

Coding interview with experienced engineers

  1. Two Sum.
  2. Remove a node from a linked list, solved in as many different ways as they could.

About four weeks end to end.


46: A one-day loop of three 90-minute interviews

Report date: 2026-07-08 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

HR set up a single loop day.

Loop interviews 1 and 2 (live coding, 90 minutes each)

  1. Majority Element. The round stressed clean code.

Loop interview 3 (90 minutes, behavioral, with the department manager)


47: Redmond — sort it when it doesn't fit in memory

Report date: 2026-07-06 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Two back-to-back interviews

  1. A medium coding problem (not named).
  2. Sort data when the whole array doesn't fit in memory (medium difficulty).

48: Monterrey — a recruiting event, then four in-person sessions

Report date: 2026-07-02 · Role: Software Engineer (Internship) · Location: Monterrey, Mexico · Channel: Recruiter · Result: Offer

Round 1 at a university recruiting event (in person)

  1. A lighter technical question, and they ranked their team interests.

Round 2 in another city (travel paid; four in-person sessions with four interviewers)

  1. One behavioral and one technical question.
  2. One technical and one design question.
  3. Two technical questions.
  4. One technical question where the interviewer wanted more back-and-forth on clarifications.

One named problem from the day: check whether a number is a palindrome without turning it into a string.

About two weeks end to end.


Patterns across the reports

These cover all 232 Software Engineering Intern reports in Parts 1–5. Report numbers run across the parts.

  1. LRU Cache is the problem that keeps coming back. Eight reports name it (26, 42, 52, 69, 106, 195, 209, 230), from India, Israel, Qatar and reports with no location, between January 2025 and September 2026. It appeared in an OA (209) as well as in interviews; 195 wanted O(1) operations, 69 wanted the data-structure complexity explained, and 230 got a variant.

  2. Linked lists show up far more than their reputation suggests. 33 reports mention them. Five name plain reversal (39, 52, 71, 169, 214), usually with a twist: in place, recursively, or half the list first. Others asked for a palindrome check and then a count of palindromes (70), k-group reversal (112, 166), or a stack built on a linked list that tracks its middle (189).

  3. Valid Parentheses came up five times. Reports 30, 35, 121, 189 and 229 name it, in the US, India and Israel. In 229 the string also held other characters.

  4. Israel has its own favorite: a structure with O(1) setAll. Four reports from Israel (55, 116, 206, 229), spread from January 2025 to June 2026, asked for get, set and setAll (or add) that all run in constant time.

  5. The loop shape depends on where you are. In the US, 44 of 62 reports describe two interviews, often back to back. In Israel, 15 of 18 describe three interviews, usually on one day. In Europe, 14 of 23 describe three. India reports more often mention an OA (38 of 66) and an HR round (10). Part 1 breaks this down by region.

  6. Behavioral questions sit inside the technical rounds. Five reports describe about 15 minutes of behavioral or CV questions at the start of their interviews (70, 80, 105, 110, 154), and 136 gave it the first 20 minutes. Tell me about yourself was asked in eight reports, and Why Microsoft in six.

  7. Some loops had little or no coding. 06 had two interviews with no coding problem at all, 14 had one behavioral and one design round, 17 spent most of the time on culture fit, and the second interview in 179 had no coding reported. All four got offers.

  8. Interviewers change the rules partway through. In 102 the candidate lost first extra data structures and then hash maps; in 223 Python's dict was taken away; in 179 Climbing Stairs was pushed down to O(1) space; in 54 the level-order traversal had to print without storing every level; and in 86 a solved problem came back modified.

  9. Candidates write their own tests. In 09, 173 and 193 the candidate had to build their own test cases, and 33 was expected to list test cases and edge cases. 118 was pushed on test cases and boundary values, and 104 made edge-case tests part of their own routine.

  10. One OA task came back in two reports. In late August and early September 2025, reports 158 and 170 both got the adjacent-swap task that maximizes the sum of arr[i] × (i + 1), each element swapped at most once, with the same [2, 1, 4, 3] example. One candidate failed that OA; the other found it easy.

Common questions

How many interviews does the Microsoft SWE intern loop have?

It depends on the region: two in most US reports (44 of 62), three in most Israel (15 of 18) and Europe (14 of 23) reports, and one or two technical rounds after an OA in India.

Does Microsoft give SWE interns an online assessment?

Often in India (38 of 66 reports) and in Israel as a home exam or online test (12 of 18); 21 of 62 US reports mention one, and four US candidates were moved straight to the final round (117, 125, 159, 178).

What coding questions does Microsoft ask SWE interns most?

LRU Cache (8 reports), Valid Parentheses (5) and linked-list problems (33 reports, often reversal with a twist); see Patterns.

Does Microsoft ask behavioral questions in SWE intern interviews?

Yes, in 82 of 232 reports, usually inside the technical rounds: about 15 minutes at the start in five reports (70, 80, 105, 110, 154). "Tell me about yourself" came up in eight and "why Microsoft" in six.

Keep practicing

In this series: Part 1 (current) · Part 2 · Part 3 · Part 4 · Part 5 · Part 6

Sources: Anywhere useful interview info can be found.

Next in this seriesMicrosoft SWE Intern, Early 2026: 54 Experiences (Part 2 of 6)
0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.