← Back to Directory

Microsoft interview notes, page 58 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

Jul 2026
Microsoft SWE coding round, one parsing question the whole time. Seemed straightforward at first but the '*' separator twist made it messier than expected.
  • Write a function to parse a string into tokens, where tokens are split by spaces normally, but if a '*' character appears in a segment, it acts as the delimiter instead of spaces.

“I read the examples a couple times before I felt like I actually understood what was being asked.”

View Post

Microsoft·Software Engineer·Hiring Manager Screen

Jul 2026
Hiring manager round at Microsoft for a software engineering role. Pretty conversational, focused on past work and how much I knew about LLMs rather than any coding or design problems.
  • Walk me through your past experience and the projects you've worked on.
  • How familiar are you with large language models and what do you understand about how they work?

“Standard opener but I always fumble the pacing on these.”

View Post

Microsoft·Product Manager·Onsite - Product Sense / Strategy

Jul 2026
PM interview at Microsoft with a product analytics diagnostic question. Single question, case-style, no fluff.
  • You're the PM for ESPN's website and you notice web traffic has dropped 30%. How do you investigate and respond?

“My first instinct was to jump straight to solutions, which is exactly the wrong move.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jul 2026
Microsoft SWE interview with a single algorithmic question about circular arrays. Pretty standard stuff but I fumbled the setup a bit before getting to a clean solution.
  • Given a circularly sorted array, find the number of rotations that have been applied to it.

“I knew this was a binary search problem pretty quickly but spent too long second-guessing the edge cases, like what happens when the array has duplicates or is already sorted.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jul 2026
Interviewed for a data analyst role at Microsoft and got hit with a retention deep-dive question. Pretty standard product analytics territory but the open-endedness of it tripped me up more than I expected.
  • The product team is seeing a drop in 30-day user retention. How would you investigate and address this?

“I jumped straight into segmentation without first clarifying what 'decline' actually meant, like whether it was a sudden drop or a slow bleed over weeks.”

View Post

Microsoft·Software Engineer·Online Assessment (OA)

Jul 2026
Got the HackerRank link for a Microsoft SWE intern role and had one very practical question before even starting.
  • Is the HackerRank online assessment camera-enabled or proctored?

“Genuinely just wanted to know if I needed to look presentable or could do it in my pajamas.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jul 2026
Two pretty gnarly algorithm questions for a Microsoft SWE round. Both had that flavor where the naive solution is obvious but they clearly want you to think harder about complexity and correctness edge cases.
  • You have n identical servers and m ordered tasks with given processing times. Each server gets a contiguous block of tasks, covering all tasks in order. The load of a server is the sum of its tasks' times. Find the minimum possible value of the maximum load across all servers. Walk through the algorithm, prove it correct, analyze complexity, and compare binary search on the answer versus dynamic programming. Use n=3, m=6, burstTime=[4,3,2,2,2,6] as a worked example (optimal max load is 7).
  • Given an array of integers, count all pairs (i, j) with i < j such that the pair is 'perfect', defined as: min(|x-y|, |x+y|) <= min(|x|, |y|) AND max(|x-y|, |x+y|) >= max(|x|, |y|). Design something faster than O(n^2), handle zeros and duplicates, and validate on arr=[2, 5, -3] which has exactly two perfect pairs: (2,-3) and (5,-3).

“I jumped straight to DP because it felt more familiar, but then they asked me to compare it against binary search on the answer and I kind of fumbled explaining why binary search is cleaner here.”

View Post

Microsoft·Data Scientist·Technical Phone Screen

Jul 2026
Microsoft Data Scientist interview focused heavily on KNN fundamentals, which sounds basic until you're actually in the room trying to explain curse of dimensionality without sounding like you memorized a textbook. Pretty technical throughout, no behavioral fluff.
  • Walk me through how KNN works for both classification and regression tasks.
  • What are the main hyperparameters in KNN and how do they affect model behavior? Things like K, distance metric, and neighbor weighting.
  • What preprocessing steps matter most for KNN and why?
  • What are KNN's biggest weaknesses, and how does it behave under class imbalance, high dimensionality, or large datasets?
  • How would you choose K and evaluate the model in a way that prevents overfitting?
  • How could dimensionality reduction like PCA help KNN, and are there cases where it would actually hurt?

“Started fine on classification, majority vote among neighbors, clean enough.”

View Post

Microsoft·Software Engineer·Onsite - Coding / Algorithms

Jul 2026
Two coding problems for a Microsoft SWE round, both required. The CSV one was more involved than I expected, and the DNA fragment problem had a few follow-ups that pushed into graph territory. Not a lot of behavioral stuff, just straight implementation.
  • Build an in-memory table initialized from a CSV string. You have to write the CSV parser yourself, supporting quoted fields, embedded commas, escaped quotes, and newlines inside quotes. Then expose a query API with column projection and a predicate function per row.
  • Given a list of fragments each with start, end, and payload fields, where the end of one fragment connects to the start of another, reconstruct the chain and return the payloads concatenated in order.
  • Follow-up: what if each fragment only has two endpoint labels and no explicit direction? Treat each fragment as an undirected edge and reconstruct any valid Eulerian path using all fragments.
  • Second follow-up: the input might contain multiple disconnected chains. How do you detect all components and return the payload sequence for each? Also, how would you detect invalid inputs like cycles, branches, or duplicate edges?

“The parser part is what trips people up.”

View Post

Microsoft·Software Engineer·Technical Phone Screen

Jul 2026
Two coding questions for a Microsoft SWE round. Both were pretty standard algorithm/design problems but the second one had some tricky edge cases I didn't fully think through in time.
  • Given a list of meeting time intervals, find the minimum number of rooms needed to schedule all meetings without conflicts.
  • Design a token manager class that supports generating tokens with a TTL, renewing unexpired tokens, and counting currently unexpired tokens.

“Classic interval scheduling problem.”

View Post