Microsoft·Software Engineer·Technical Phone Screen
- 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.”
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
“Classic sliding minimum problem.”
“I started sorting the array which was the right call, but then I fumbled around trying to explain why for like a minute.”
“I jumped straight into screen reader support and keyboard navigation like that was the whole answer.”
“My first instinct was to just do a recursive DFS and return the node when I found either p or q.”
“I went straight to the obvious cases: empty tree, single node, and then kind of stalled.”
“This is basically the whole round in one question.”
“The recursive versions came out fine.”
“The set operation is straightforward, just append to a list per key.”
“This was the core of the whole session.”
“I rambled a bit here.”