Explore questions associated with Microsoft. Review the source details, then use the workspace for code, notes, and diagrams.
454 questions in the library. A source association does not guarantee a future interview question.
Behavioral and leadership · Coding · Machine learning · ML system design · Object-oriented design · Other questions · Practical engineering · System design
Loading questions…
Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.
© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.
Showing 351–375
Companies: Microsoft
Product Design & Improvement · Search Relevance
Given an array of daily stock prices, compute the maximum profit achievable from exactly one buy-before-sell transaction (i.e., the largest prices[j] - prices[i] with j…
Companies: Microsoft, Adobe, Amazon, Apple +10
Array · Dynamic Programming
Companies: Microsoft
AI-Assisted Development · Model Evaluation
Companies: Microsoft
Annotation & Label Quality · Data Cleaning & Wrangling
Count the number of distinct sequences of 1- or 2-step moves that sum to n — the ways follow the recurrence ways(n)=ways(n-1)+ways(n-2) (i.e., Fibonacci-like), with…
Companies: Microsoft, Bloomberg, Google, Intuit +1
Dynamic Programming · Math · Memoization
Return each person's first and last name along with their city and state by performing a left join of Person with Address on personId, showing…
Companies: Microsoft, Google, Meta
Database
Companies: Microsoft
Computer Vision · ML Coding
Companies: Microsoft
AI Safety & Alignment · Fine-Tuning & Alignment Techniques
Companies: Microsoft
ML Coding · Model Evaluation
Companies: Microsoft, Amazon, Google, Meta
Math
Count how many ways a given n (1 ≤ n ≤ 10^9) can be written as a sum of consecutive positive integers. The core challenge…
Companies: Microsoft, Meta
Enumeration · Math
Companies: Microsoft, Amazon, Amdocs, Google +1
Array · Math
Given heights of vertical lines at unit-spaced x-coordinates, pick two indices i<j to maximize the area min(height[i],height[j])*(j-i). With n up to 1e5, the problem requires…
Companies: Microsoft, Amazon, Bloomberg, Cisco +4
Array · Greedy · Two Pointers
Companies: Microsoft, Amazon, BNY Mellon, Harness
Array · Bit Manipulation · Monotonic Stack · Stack
Companies: Microsoft
Array · Dynamic Programming · Prefix Sum
Companies: Microsoft
Array · Dynamic Programming · Matrix · Prefix Sum
Companies: Microsoft, Amazon, Bloomberg, Google +1
Array · Counting · Divide and Conquer · Hash Table
Companies: Microsoft, Amazon
Array · Divide and Conquer · Hash Table · Merge Sort
Companies: Microsoft
Durable timed execution: recurring occurrences, reliable dispatch, worker leases, retries, and duplicate side effects.
Companies: Microsoft, Amazon, Atlassian, DoorDash +3
backpressure · durable-queues · fault-tolerance · idempotency