Microsoft SWE Intern, Mid 2025: 42 Experiences (Part 4 of 6)
- Company
- Microsoft
- Reports
- 42 interview reports
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Microsoft SWE intern reports from July to September 2025: résumé and behavioral questions led, plus the most math and puzzle questions in the series.
At a glance
- Process: OA, phone screens, then interview rounds; one US candidate had five onsite rounds, ending with an unprepared presentation and demo of a past project.
- Asked: résumé and project questions in 16 of these 42 reports and behavioral in 14; arrays and hashing (11) and strings (10) led the coding, and 6 had math, bit or puzzle questions.
- More: the question tables for all 232 reports, the regional notes and the patterns are in Part 1.
Coverage: Internship cohort, Software Engineering Intern role, reports 150–191, dated July 2025 to September 29, 2025. None is from the Security & Identity internship. Locations: India 18, US 13, not stated 4, Ireland 2, China 2, and one each from Canada, Australia and Costa Rica. Stages: OA, phone screens, interview rounds and finals. Dates are report dates unless a report gives an interview date; thirteen reports carry only a month.
In this series
- Part 1: 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 (current): 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
Resume and project questions (16 of 42) and behavioral questions (14) led. On the coding side, arrays and hashing (11) and strings (10) came up most, and this part has the most math, bit and puzzle questions of any part (6).
| Topic | Reports | Last seen |
|---|---|---|
| Resume, project and past-internship deep dives | 16 of 42 | Sep 2025 (report date) |
| Behavioral and motivation questions | 14 of 42 | Sep 2025 (report date) |
| Arrays and hashing | 11 of 42 | Sep 2025 (report date) |
| Strings | 10 of 42 | Sep 2025 (report date) |
| CS fundamentals (OS, OOP, DBMS, networks) | 7 of 42 | Aug 2025 (report date) |
| Math, bits and puzzles | 6 of 42 | Sep 2025 (report date) |
| Graphs, BFS/DFS and dependency ordering | 6 of 42 | Sep 2025 (report date) |
| Linked lists | 5 of 42 | Sep 2025 (report date) |
| Trees, BSTs and tries | 5 of 42 | Sep 2025 (report date) |
| Dynamic programming | 5 of 42 | Aug 2025 (report date) |
| System and low-level design | 5 of 42 | Aug 2025 (report date) |
| Sliding window and two pointers | 5 of 42 | Jul 2025 (report date) |
| Design a data structure or class (LRU, trie, setAll, hash map) | 4 of 42 | Sep 2025 (report date) |
| Grids and matrices | 4 of 42 | Sep 2025 (report date) |
| Stacks, queues and heaps | 4 of 42 | Jul 2025 (report date) |
| Greedy and backtracking | 3 of 42 | Sep 2025 (report date) |
A report can count toward several topics. The counts use this part's 42 reports.
Questions we found
These tables cover only this part's 42 reports. Part 1 has the tables for all 232 Software Engineering Intern reports.
Algorithms / Data Structures
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design tic-tac-toe | 1: 174 | Aug 2025 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Design an inventory management system | 1: 175 | Aug 2025 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Tell me about yourself | 1: 159 | Sep 2025 |
| Why Microsoft? / Why do you want to join Microsoft? (practice) | 1: 165 | Sep 2025 (report date) |
| 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: 184 | Jul 2025 |
CS fundamentals (concept questions)
| Question | Reports | Last seen |
|---|---|---|
| What happens when you type a URL into a browser? | 1: 175 | Aug 2025 |
Other
| Question | Reports | Last seen |
|---|---|---|
| Design an A/B test | 1: 150 | Sep 2025 |
42 detailed candidate timelines, loops, and screens
150: Canada — an easy string question and a depth check on skills
Report date: 2025-09-29 · Role: SWE Intern · Location: Canada · Result: Offer
Interview 1 (45 minutes, one interviewer)
- An easy string coding question.
- A behavioral question.
Interview 2 (45 minutes, after a 15-minute break)
- Their experience and skills, in technical depth.
151: US — union of two arrays, then an A/B test
Report date: 2025-09-29 · Role: Software Engineer (Internship) · Location: United States · Result: No offer
Interview (on Teams, which took 10 minutes to load)
- Union of two arrays.
- Design an A/B test.
152: US — five onsite rounds, including a surprise presentation
Report date: 2025-09-26 · Role: Software Engineer Intern · Location: United States · Result: Offer
Three 45-minute technical onsites with engineers on the team
Two behavioral rounds
- Experiences and interests.
- An unprepared presentation on a past project, with a short demo.
153: Redmond — a systems-heavy role, so build a linked list
Report date: 2025-09-25 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
Two back-to-back interviews on the same day
- Implement a linked list from scratch.
- Hash map questions. The candidate said these weren't typical puzzle problems because the role was systems-heavy.
154: Dublin — three interviews with 15 minutes of behavioral each
Report date: 2025-09-20 · Role: Software Engineer Intern · Location: Dublin, Ireland · Result: Offer
Three back-to-back 45-minute interviews
- Contains Duplicate.
- About 15 minutes of behavioral questions per interview.
155: US — one puzzle problem, one implementation problem
Report date: 2025-09-18 · Role: Software Engineer Intern · Location: United States · Result: Offer
Two back-to-back 45-minute interviews (one problem each)
- An easy-to-medium algorithm problem.
- An easy-to-medium problem that leaned on implementation more than tricks.
- Explain the past experiences on your resume.
156: India — brute force, then the trade-offs
Report date: 2025-09-09 · Role: Software Development Engineer (SDE) Intern · Location: India · Result: No offer
Online assessment
Two DSA interviews
- An array problem: brute force first, then an optimized version, with a time vs. space trade-off discussion.
- Resume projects.
157: A hard opener, then an optimal finish
Report date: 2025-09-09 · Role: Software engineering intern · Location: Not stated · Result: Not known when posted
Two back-to-back rounds (no problem text shared)
Round 1
- A hard problem. They explained the approach and the interviewer agreed, but they didn't finish the code. The follow-up asked how to improve the algorithm itself, not its complexity.
Round 2
- They wrote the optimal solution.
158: OA — cut the sticks and a one-swap strength sum
Report date: 2025-09-08 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Failed the OA
Online assessment (2 problems)
- Cut the sticks: each round, remove every stick of the current shortest length and cut that length off the others; return how many sticks are left at the start of each round. For [1, 1, 3, 4] the answer is [4, 2, 1].
- Maximize the sum of arr[i] × (i + 1) using adjacent swaps, with each element in at most one swap. For [2, 1, 4, 3] the best order is [1, 2, 3, 4].
159: Redmond — an easy problem with follow-ups and a hard matrix one
Report date: 2025-09-07 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Channel: Applied online · Result: No offer
A resume screen led straight to the finals.
Two final rounds
- Tell me about yourself.
- An easy problem with follow-ups.
- A medium-to-hard matrix problem.
160: Hyderabad campus — quicksort and a math riddle
Report date: 2025-09-07 · Role: SWE Intern · Location: Hyderabad, India · Channel: On campus · Result: Offer
Coding round (2 easy-to-medium problems)
Two technical interviews
- Implement quicksort.
- A riddle you could solve with simple math.
161: Azure Virtual Desktop off-cycle intern, China — three rounds
Report date: 2025-09-02 (rounds 1–2 posted 2025-08-29) · Role: Software engineering intern, off-cycle · Team: Azure Virtual Desktop · Location: China · Result: Verbal offer
Round 1
- Deep questions on a previous internship.
- Rotate a matrix by 90 degrees.
Round 2 (relaxed)
- Internship and project chat.
- Combination Sum: given an array and k, return every combination that adds up to k, with elements reusable any number of times.
Round 3
- Five minutes of small talk, then about 25 minutes on internship work, including how a strength they'd claimed on the resume showed up on the job.
- An open scenario: remove redundant task-dependency edges. A file lists dependency pairs. Some edges are implied by others: if d depends on both a and c, and c already depends on a, the direct d-to-a edge adds nothing. Those extra edges make the file grow fast. Any angle was fine, not just an algorithm, and the interviewer cared more about the thinking than a perfect answer.
The same author later said a separate Microsoft interview of theirs was for a vendor role. Whether this AVD role was a direct hire isn't stated.
162: Bengaluru — greedy and graph OA, graph and tree interview
Report date: 2025-09-02 · Role: Software Development Engineer (SDE) Intern · Location: Bengaluru, India · Result: Offer
Online test (120 minutes, 2 problems around medium-hard)
- A greedy problem.
- A graph problem.
Interview (about 60 minutes, 30 per problem)
- A medium graph problem.
- A medium tree problem.
HR round
- Resume projects and technologies.
163: Redmond — a hash table problem and a string splitter
Report date: September 2025 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
Interview 1 (1 problem)
- A hash table coding problem.
Interview 2 (1 problem)
164: Sydney — a debugging story, traced end to end
Report date: September 2025 · Role: Software Engineer Internship · Location: Sydney, Australia · Result: Not known when posted (marked no offer)
Two interviews, with an hour's break between them
- Describe a time you helped debug something in the frontend or backend. Follow-ups: how did the bug spread, and what was your debugging process?
165: Redmond — stock prices, pattern matching and favorite classes
Report date: September 2025 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer
Online assessment
Interviews. Across them:
- Best Time to Buy and Sell Stock.
- A pattern-matching problem.
- A binary-tree traversal problem.
- Why Microsoft?
- Tell me more about your previous experience.
- What would you like to work on?
- What was your favorite class in college?
166: Hyderabad — k-group reversal on HackerRank
Report date: September 2025 · Role: SDE-intern · Location: Hyderabad, India · Result: No offer
Interview (on HackerRank)
167: India — longest palindromic substring, 20 days after the OA
Report date: 2025-08-31 · Role: SDE-intern · Location: India · Result: No offer
Online assessment (2 medium questions, done in 40–50 minutes)
Interview, 20 days later (2 problems)
- Length of the longest palindromic substring.
- A hashing question.
- Behavioral questions and a project discussion.
168: OA — most frequent character and every diameter endpoint
Report date: 2025-08-29 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Passed the OA
Online assessment (75 minutes, 2 problems; the candidate rated it easy)
- Return the most frequent character in a string.
- Find a tree's diameter and return every node that can be one of its endpoints.
169: New Delhi — reverse a list both ways
Report date: 2025-08-28 · Role: Software Development Engineer (SDE) Intern · Location: New Delhi, India · Result: No offer
Online interview (3 questions)
- Reverse a singly linked list with no extra space, explaining both the iterative and recursive versions and their complexity.
- Array and string problems.
- Their resume achievements.
170: Redmond summer 2026 OA — column costs and the strength sum again
Report date: 2025-08-28 · Role: SWE summer 2026 intern · Location: Redmond, Washington, US · Result: Not known when posted
Online assessment (75 minutes, 2 problems; the candidate found both easy)
- Make every column of a pixel-intensity grid strictly increasing from top to bottom. You can only raise values, at a cost of 1 per unit; return the minimum total cost. For [[2,5],[7,4],[3,5]] the answer is 9.
- getMaximumSumOfStrengths, the same adjacent-swap task as report 158. For [2, 1, 4, 3] the answer is 30.
171: US — battleships, then deep OS and BIOS questions
Report date: 2025-08-27 · Role: SWE Intern · Location: United States · Result: Offer
Interview (1 problem)
- A medium battleship problem on a 2D grid.
- Deep operating-systems and BIOS questions.
172: Bengaluru area — speed decided the shortlist
Report date: 2025-08-18 · Role: Software Engineer (Internship) · Location: Bengaluru area, India · Result: No offer
Coding assessment (2 problems; the stage isn't named)
- A probability question.
- A DP question.
They solved both but slowly and weren't shortlisted, which they put down to speed.
173: Windows 365 off-cycle intern, Suzhou — five interviews across two teams
Report date: 2025-08-16 · Role: Software engineering intern, off-cycle (backend) · Team: Windows 365 · Location: Suzhou, China · Channel: Applied through a job post on a social app · Result: Offer
The candidate summed up five interviews across two departments instead of going round by round.
- Coding prompts were in English and mostly well-known standard problems. They had to write their own test cases, and coverage counted.
- Some system design questions, which they found the hardest part.
- Project discussion and behavioral questions.
- Little rote fundamentals; only one interviewer pushed on them.
All five interviewers were friendly. The team works in C# and TypeScript.
174: Redmond — tic-tac-toe and the next prime
Report date: 2025-08-13 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: No offer
Two back-to-back interviews
- Build a tic-tac-toe game (framed as a systems question).
- Given a number, return the smallest prime at or above it.
175: Hyderabad — OS, a merge, and an inventory system
Report date: August 2025 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Result: No offer
Technical interview
- Operating systems: multitasking, process management, inter-process communication.
- Implement a binary tree.
- Merge two sorted linked lists.
- Spot the errors in a piece of code.
- How would you build an inventory management system?
- What happens when you type a URL into a browser?
HR interview
- Personality, goals, motivation, teamwork and decision-making.
176: India — next larger value in a BST
Report date: August 2025 · Role: SDE-intern · Location: India · Result: No offer
Online assessment
Technical interview
HR round
177: Costa Rica — a 75-minute string task
Report date: August 2025 · Role: Software Engineer (Internship) · Location: Costa Rica · Result: No offer
Coding assessment (about 75 minutes, 2 problems; two weeks to prepare before starting)
- A string-manipulation exercise.
178: Redmond — straight to the final, Course Schedule first
Report date: 2025-07-30 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Result: Offer
They went straight to the final round.
Final 1
- Course Schedule (graph, topological sort).
- A small systems question.
Final 2
- An easy-to-medium sliding-window array problem.
179: India, summer 2026 — knapsack-style OA and Climbing Stairs done four ways
Interview date: 2025-07-27 (both interviews) · Role: Software Engineering Intern · Location: India · Result: Offer, about 3 hours after the last interview
OA (2 questions)
- A medium two-pointer problem.
- A DP problem modeled on 0/1 knapsack. The report names the model but not the actual items or values.
Interview 1, DSA and projects
- Climbing Stairs: from plain recursion to memoization, then tabulation, then O(1) space.
- Full-stack projects: why that stack, state-management trade-offs, the hardest bug, and how they'd re-architect for scale.
Interview 2, technical and HR (no coding reported)
- A backend project's architecture, SQL vs. NoSQL, everyday debugging habits, and how they learn an unfamiliar codebase.
- Growth-mindset scenarios: building collaboration in a team; what to do when a 24-hour deadline runs into a critical bug; and what a past project failure taught them.
180: Dublin — three onsites, one problem each, plus math
Report date: 2025-07-25 · Role: SWE Intern · Location: Dublin, Ireland · Channel: Applied online · Result: Offer
Online assessment
Three onsite interviews (one problem each, behavioral and experience questions in each)
- A common two-pointer / hash map question.
- Two math-related questions.
181: India off-campus — anagrams from a dictionary
Report date: 2025-07-24 · Role: Software Development Engineer (SDE) Intern · Location: India · Channel: Off campus · Result: No offer
Online assessment
Technical interview
The candidate listed the off-campus pipeline as a resume screen, the OA, one or two technical interviews, then HR.
182: SDE intern, short account — graph and DP in a 70-minute OA
Report date: 2025-07-23 (report date; the interview may be older) · Role: SDE Intern · Location: Not stated · Result: Not stated
- OA (70 minutes): two medium-to-hard problems, one on graphs and one on DP. They believed that passing about 70% of all test cases was enough for an interview call.
- Technical interview 1: standard DSA from almost any topic, plus core CS subjects.
- Technical interview 2: some DSA, mostly project discussion, maybe a few HR questions.
183: New Delhi — explain a monotonic stack, then code it
Report date: 2025-07-16 · Role: SDE-intern · Location: New Delhi, India · Result: No offer
Interview (35–40 minutes for the coding task)
- A monotonic-stack problem: explain the logic first, then code it.
184: India on-campus — HackerRank OA, then projects and a digit-sum trick
Interview date: 2025-07-14 · Role: SWE Intern · Location: India (on-campus; interviewers in Hyderabad) · Result: Offer, the same evening
OA (HackerRank; 1.5 hours inside a 2-hour window)
- A subsequence problem.
- A graph traversal problem (DFS/BFS).
Both were done in about 40 minutes. The interview invite came with a form to rank three preferred teams out of about ten.
Technical interview (senior engineer, about 1 hour, coding on HackerRank)
- A past internship at a logistics company in detail, with behavioral questions mixed in, plus their GitHub history.
- A team project and how the team coordinated.
- A few CS fundamentals.
- A DSA question on a basic math idea tied to binary addition, with a few follow-ups.
Managerial and technical interview (manager, about 1 hour 20 minutes, in their own editor)
- Skills on the resume: JavaScript, TypeScript, MongoDB.
- The team project's overall design; once Kafka came up, broader high-level design ideas.
- Whether they use competitive programming sites, and more on the past internship.
- Digital root of a numeric string: keep adding the digits until one digit is left, in O(1). For example, 28 gives 10, then 1. A few follow-ups.
They were placed in a healthcare-domain team rather than one of their Azure picks.
185: US — a coding phone screen, then two interviews
Report date: 2025-07-07 · Role: Software Engineer Intern · Location: United States · Result: Offer
Phone interview (coding)
Two back-to-back interviews
- Coding questions such as backtracking and DP.
- A couple of behavioral questions and questions about which teams and orgs interested them.
186: San Francisco — stopped at the assessment
Report date: July 2025 · Role: Software Engineer (Internship) · Location: San Francisco, California, US · Channel: Recruiter at the university · Result: No offer
Assessment (2–4 medium-to-hard problems)
They didn't pass, so the later HR and technical rounds (motivation, system design) never happened. A recruiter visiting their university started the process.
187: Bengaluru — two problems with dry runs, then SQL and OOP basics
Report date: July 2025 · Role: SWE Intern · Location: Bengaluru, India · Result: No offer
Interview (under an hour)
- Two easy-to-medium coding questions, each with time and space complexity and a dry run.
- SQL, OOP and DBMS basics, such as primary keys and friend functions.
- A few questions on resume projects.
188: Bengaluru campus — a text editor in the OA
Report date: July 2025 · Role: SWE Intern · Location: Bengaluru, India · Channel: On campus · Result: No offer
Online assessment (2 easy problems, solved in about 25 minutes)
They weren't shortlisted and felt the shortlist after the OA looked random.
189: New Delhi — an SDE 2, then a Principal Engineering Manager
Report date: July 2025 · Role: SDE-intern · Location: New Delhi, India · Result: No offer
Online assessment (2 easy-to-medium problems on graphs and sliding windows)
Technical round 1 with an SDE 2 and technical round 2 with a Principal Engineering Manager (2 problems each). Across them:
- Balanced parentheses.
- Climbing Stairs.
- A palindrome check in O(1) space.
- A stack built on a linked list that also tracks its middle element.
- A project review (round 2).
190: New Delhi — a deque and a fixed-size window
Report date: July 2025 · Role: SDE-intern · Location: New Delhi, India · Result: No offer
Online assessment (2 problems)
- A medium-easy array / deque problem.
- A medium-hard fixed-length sliding-window problem.
Interviews 1 and 2: standard medium coding problems in both.
191: Bengaluru — an easy heap, then one they couldn't optimize
Report date: July 2025 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Result: No offer
Interview (2 problems)
- Kth largest element, an easy heap question.
- A second problem they couldn't optimize.
Common questions
Does Microsoft repeat SWE intern OA questions?
In this part, reports 158 and 170 got the same adjacent-swap OA task (maximize the sum of arr[i] × (i + 1), each element swapped at most once) in late August and early September 2025.
Keep practicing
- Practice problems from reports 150–191, with the report numbers they came from: Union of two arrays (151); Contains Duplicate (154); Cut the sticks (158); Maximize the strength sum with one-time adjacent swaps (158, 170); Implement quicksort (160); Rotate a matrix 90 degrees (161); Combination Sum (161); Remove redundant task-dependency edges (161); Split a string by a character, substring or regex (163); Best Time to Buy and Sell Stock (165); Reverse Nodes in k-Group (166); Longest Palindromic Substring (167); Most frequent character in a string (168); Reverse a linked list (169); Make grid columns strictly increasing at minimum cost (170); Count battleships on a board (171); Smallest prime at or above a number (174); Merge two sorted linked lists (175); Design an inventory management system (175); Inorder successor in a BST (176); Course Schedule (178); OA DP problem modeled on 0/1 knapsack (179); Climbing Stairs (179, 189); Find every anagram of a word in a dictionary (181); Digital root of a numeric string in O(1) (184); Text editor with insert, delete and backspace (188); Valid Parentheses (189); Stack that also tracks its middle element (189); Kth Largest Element in an Array (191).
- Microsoft system design questions and Microsoft behavioral questions: the company question banks (sign-in needed).
- Microsoft interview page: Microsoft practice grouped by reported stage.
- Microsoft hiring insights: OA and interview insights for Microsoft.
- Experience feed: more interview reports and roundups.
In this series: Part 1 · Part 2 · Part 3 · Part 4 (current) · Part 5 · Part 6
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.