Microsoft Software Engineer interview questions

198 Software Engineers have shared notes from their Microsoft interviews, with the questions they were asked in each round. That is 84% of the 236 Microsoft interview notes on Screna AI.

198 Software Engineer interview notes

Microsoft·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Round 3 at Microsoft for a software engineer role. It was a LeetCode-style coding problem, a variant of a problem in the 700s range, with the input swapped to two string arrays instead of the usual format. Had to run test cases after finishing, which added a bit of pressure.
  • Solve a variant of a mid-700s LeetCode problem where the input is modified to take two string arrays instead of the original format, then run your own test cases to verify the solution.

“The core logic wasn't too far off from the original problem, but the two string arrays input threw me for a bit longer than I'd like to admit.”

View Post

Microsoft·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Microsoft SWE interview that went deep on systems internals. The main problem was building an in-memory database with a SQL-like interface, and it kept expanding into design territory once the basic implementation was done.
  • Implement an in-memory database that supports INSERT and SELECT with WHERE filtering and ORDER BY sorting.
  • Compare row-oriented vs column-oriented storage for this use case. What are the tradeoffs?
  • How would you add an index to this database, and what data structure would you use?
  • How does adding a WHERE clause and ORDER BY together affect the query execution plan?

“Started with a list of dicts and just iterated for filtering.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jun 2026
Microsoft coding interview, one algorithmic problem that looked straightforward until I actually had to implement it under pressure.
  • Given an m x n grid of integers, find a path from the top-left to the bottom-right corner (moving in any of the four directions) such that the minimum value along the path is as large as possible. Return that maximized minimum value.

“I knew there were two ways to go at this: binary search combined with a BFS/DFS to check feasibility, or a Dijkstra-style approach with a max-heap tracking the bottleneck value.”

View Post

Microsoft·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Microsoft system design round for a software engineer role. One question, but it had a lot of moving parts and I don't think I covered all of them as well as I should have.
  • Design an incident management agent that serves different content based on user roles, while also handling scale and potential abuse.

“The role-based content part I felt decent about, talked through access control layers and how the agent would determine what to surface depending on who's asking.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jun 2026
Got a coding question at Microsoft for a software engineer role. Pretty algorithmic, nothing behavioral from what I remember. Left feeling okay about it but not certain.
  • Given an integer n, return any valid n-bit Gray code sequence, where every adjacent pair of integers in the sequence differs by exactly one bit in binary, including the first and last elements.

“I knew there was a clean formula for this but blanked on it mid-interview and started going down a recursive path that was getting messy.”

View Post

Microsoft·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Microsoft system design round focused entirely on building a RAG pipeline end to end. Pretty deep dive, they wanted real trade-off reasoning not just a high-level sketch.
  • Design a Retrieval-Augmented Generation pipeline that takes a user query, retrieves relevant passages from a large corpus, ranks them, and returns the top K results to inject into an LLM prompt.

“This is a big question and I underestimated how far they'd push on each layer.”

View Post

Microsoft·Software Engineer·Onsite - Multi Round

Jun 2026
Microsoft SWE round that mixed behavioral questions with a surprisingly meaty coding/design block centered on rate limiting. Not a pure system design round but not a pure coding round either, which threw me off a bit at first.
  • Tell me about a time you had to make a significant trade-off on a project. How did you decide, and what was the outcome?
  • Describe a situation where you had to collaborate closely with others to deliver something. What was your specific contribution?
  • Design and implement a rate limiter for a per-user API. Walk through your algorithm options and their trade-offs, then implement one.
  • How would you extend your rate limiter to work in a distributed environment across multiple servers?

“Standard behavioral territory.”

View Post

Microsoft·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Microsoft SWE system design round focused entirely on rate limiting. The question started simple enough but kept expanding into distributed systems territory, which I was not fully prepared for.
  • Implement a rate limiter with an allow(client_id, timestamp) method that returns true or false based on a configured policy like N requests per W seconds per client.
  • Your rate limiter needs to handle 100K requests per second. Which per-client data structure do you pick and why, deque of timestamps, fixed counters, or token bucket state?
  • How would you scale the in-process rate limiter for high throughput? Think about locking strategies and per-key sharding.
  • If the rate limiter is distributed across multiple nodes, how do you coordinate state? Walk through the options and their consistency versus accuracy tradeoffs.
  • What happens when the backing store like Redis becomes unreachable? Do you fail open or fail closed, and what drives that decision?

“I jumped straight to sliding window log with a deque of timestamps because it felt clean and exact.”

View Post

Microsoft·Software Engineer·Online Assessment (OA)

Jun 2026
Microsoft OA with a graph problem that looked manageable until the hidden test cases started timing out. The complexity requirements aren't spelled out anywhere so you kind of have to guess what they expect.
  • Given a weighted graph with n nodes and m edges, for each node v find the minimum-weight cycle that passes through v (visiting at least one other node before returning). Return an array where each entry is the minimum cycle weight for that node, or 0 if no cycle exists.

“My first instinct was to just run Dijkstra from every node and call it done.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jun 2026
Microsoft interview that came down to a single data structure design problem. Nothing crazy, but the details on handling corrections and lazy deletion tripped me up more than I expected.
  • Design a data structure that supports stock price updates (including corrections to past timestamps), and can return the current price, the maximum price, and the minimum price at any time.

“The hash map part came to me pretty fast.”

View Post