← Back to Directory

Microsoft interview notes, page 34 of 60

FAANG / Big Tech

Most of these Microsoft write-ups come from Software Engineers (372), then Product Managers (124) and Machine Learning Engineers (53). The most reported rounds are the technical phone screen (255), the product sense round (111), the system design round (93) and the behavioral / leadership round (49).

597 interview notes · updated Oct 2026

Microsoft·Software Engineer·Technical Phone Screen

May 2026
Microsoft SWE coding round, one question, pretty standard stuff. They gave me a stock prices problem and I walked through it without too much drama.
  • Given an array of daily stock prices, find the maximum profit possible from a single buy-then-sell transaction. Return 0 if no profit is achievable.

“Classic sliding minimum problem.”

View Post

Microsoft·Software Engineer·Onsite - Coding / Algorithms

May 2026
Microsoft SWE coding round, one algorithm question about finding pairs in an array. Pretty standard fare but the edge cases are where it gets interesting.
  • Given an array of integers, find all pairs that have the minimum absolute difference between them.

“I started sorting the array which was the right call, but then I fumbled around trying to explain why for like a minute.”

View Post

Microsoft·Product Manager·Onsite - Product Sense / Strategy

May 2026
Microsoft product design interview, one question about accessibility for a core communication tool. Short session, but the question had more depth than I expected going in.
  • Design an email application for blind users.

“I jumped straight into screen reader support and keyboard navigation like that was the whole answer.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

May 2026
Microsoft SWE interview with a tree problem. Pretty standard algorithmic round, nothing too wild, but the LCA question has more edge cases than it looks like at first glance.
  • Given a binary tree with two nodes p and q, find their lowest common ancestor (the deepest node that has both p and q as descendants, where a node can be its own descendant).

“My first instinct was to just do a recursive DFS and return the node when I found either p or q.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

May 2026
Microsoft SWE interview that was essentially a two-part problem: first the N-ary-to-BST conversion, then a full test plan for that same solution. The testing follow-up was where things got interesting and a bit uncomfortable.
  • Design a comprehensive test plan for an N-ary tree to BST conversion function, covering functional correctness, BST invariant checks, value equivalence, and performance testing.
  • How would you write a checker to verify that the BST invariant holds after the conversion, specifically using in-order traversal?
  • How would you verify that the output BST contains exactly the same multiset of values as the input N-ary tree?
  • How would you structure the test code itself, including helpers, fixtures, and the separation between unit and integration tests?

“I went straight to the obvious cases: empty tree, single node, and then kind of stalled.”

View Post

Microsoft·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Microsoft SWE behavioral round, about 30 minutes, focused on influence and problem solving. Pretty standard stuff but the influence angle made it feel a bit more strategic than the usual 'tell me about a conflict' format.
  • Tell me about a time you influenced others to drive impact on a problem you were working on.

“This is basically the whole round in one question.”

View Post

Microsoft·Software Engineer·Onsite - Coding / Algorithms

May 2026
Microsoft SWE interview that leaned heavily on fundamentals. Three questions back to back, all algorithmic, no system design or behavioral. The kind of session where you either know your stuff cold or you're visibly scrambling.
  • Implement a binary tree node class and write preorder, inorder, and postorder traversals both recursively and iteratively using an explicit stack. Return each traversal as a list and walk through the time and space complexity.
  • Given an unweighted graph as an adjacency list and a source node, implement BFS to return the visit order, minimum edge distances from the source, and a parent map for path reconstruction. Also explain how you'd handle disconnected graphs.
  • Given an array of distinct integers, generate the power set. Provide both a backtracking solution and a purely iterative one using only for-loops, explaining how subsets grow layer by layer. Analyze the complexity.

“The recursive versions came out fine.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

May 2026
Microsoft SWE interview with a system design flavored coding problem. The core challenge was building a time-based key-value store, and the whole session basically lived or died on whether you knew binary search cold.
  • Design and implement a time-based key-value store that can store multiple values for the same key at different timestamps, and retrieve the most recent value at or before a given timestamp.

“The set operation is straightforward, just append to a list per key.”

View Post

Microsoft·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Behavioral round at Microsoft for a software engineer role, about 30 minutes focused on drive for results and problem solving. Pretty standard stuff but still worth prepping for.
  • Tell me about a time you drove a project or task to completion despite obstacles or setbacks.
  • Describe a situation where you had to solve a difficult problem with limited information or resources.

“This was the core of the whole session.”

View Post

Microsoft·Software Engineer·Hiring Manager Screen

May 2026
Interviewed for a solutions architect role at Microsoft, got one question that was pretty squarely in the sales-adjacent territory you'd expect for a customer-facing position.
  • How would you walk a customer through their concerns about pricing?

“I rambled a bit here.”

View Post