How to Crack Microsoft: The Software Engineer Interview, From Real Experiences
Prepare for Microsoft software engineer interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 15, 2026.
For interns, new grads and experienced software engineers.
Built by the Codinzhub team from Microsoft interview experiences that candidates shared, including the ones posted on Codinzhub. Each experience is one person's interview, and Microsoft changes its process by team and level, so use this as a map, not a promise.
The 30-second version. Apply on the careers site (Microsoft has no cool-off period, so you can apply to many teams), take a online coding platform or Codility OA with two coding questions, then a loop of three to five one-hour rounds on one day. Each round mixes coding with your projects, and later rounds add design. The last round is often the "As Appropriate" (AA) round with a senior person, and it carries the most weight. Code quality and clear communication score as much as the final answer.
Round-by-round breakdown
Stage 1: Application, where candidates applied
How it works. Most candidates applied on the careers portal. Some were contacted by a recruiter, and one SDE II candidate was asked to apply for level 62 by a recruiter. Campus drives in India in 2026 included IIT BHU, IIT Delhi, IIT Madras, IIT Roorkee, IIT Guwahati, IIT Indore, IIT (ISM) Dhanbad, DTU, IGDTUW, MNNIT and NIT Kurukshetra. One candidate said the process differs a lot between teams, but the bar is the same everywhere.
Stage 2: Shortlisting, how candidates moved forward
How it works. For most roles the OA comes first, and some candidates went straight from the OA to the loop with no recruiter screen. Senior candidates usually had a recruiter call and a technical screen instead. Experienced candidates were asked to pick a morning or afternoon slot for the loop.
Stage 3: Online assessment
At a glance
- Length: 60 to 120 minutes
- Questions per round: 2 coding questions (one 2026 OA gave AI hints on the second question)
- What was asked: sliding windows, binary search on the answer, DP, monotonic stacks, greedy with heaps
- Most common: binary search on the answer; renamed coding-practice problems
How it works. Usually on online coding platform, sometimes Codility. Questions are often renamed coding-practice problems. Campus candidates said almost everyone got different questions. Senior and SDE II OAs were described as hard, and one candidate's knapsack DP timed out and had to become a binary search.
OA questions candidates reported:
| Question (our summary) | What it tests | Level |
|---|---|---|
| Most frequent substring with a length range and a limit on distinct letters | Sliding window, hashing | SDE II |
| Pick k non-adjacent servers to minimise the largest value | Binary search on the answer | SDE II |
| Count binary substrings with equal, grouped 0s and 1s | Counting runs | SWE |
| Delete and Earn style: taking a value removes its neighbours | DP | SWE |
| For each k, is there a window holding exactly 1 to k? | Positions, two pointers | SWE |
| Each item's price minus the next cheaper-or-equal item to its right | Monotonic stack | SWE |
| Merge the array into one element at minimum total cost | Greedy with a heap | Intern |
| How many intervals contain each query point | Sorting, binary search | Intern |
Microsoft OA questions shared on Codinzhub:
| Question | Drive | Topic |
|---|---|---|
| Plan Production | IIT Roorkee | Hard |
| Find Error Codes | IIT Roorkee | Strings |
| Strong Password | IIT Madras | Strings |
| Text Editor | IIT Madras | Simulation |
| Get Optimal String | IGDTUW | Strings |
| Delete Odd Nodes from a Linked List | IGDTUW | Linked lists |
| Balls Collide | NIT Kurukshetra | Simulation |
| Minimum Cost to Travel from City A to City B | L60 SWE | Graphs |
| Maximum Size of a Valid Team | L60 SWE | Greedy |
| Maximum XOR | Not stated | Bits |
| Longest Palindromic Subsequence | Not stated | DP |
| Maximum Weighted Difference | Not stated | Arrays |
More questions: Browse Microsoft questions.
Stage 4: The interview loop
How it works. Three to five rounds of about an hour, often back to back on one day. Rounds mix a short introduction, your resume, CS fundamentals and one or two coding problems. Later rounds add low-level design (classes, coded), high-level design, and the AA round. One SDE II loop had a design round where AI assistance was required, and the interviewer judged how the candidate prompted and checked the AI.
Coding rounds
At a glance
- Length: 45 to 60 minutes; sometimes 90 minutes
- Questions per round: 1 to 3 problems, plus fundamentals questions
- What was asked: linked lists, trees, binary search on the answer, DP, graphs, sliding windows
- Most common: the LRU cache; linked-list problems with a twist
Questions candidates reported:
| Question (our summary) | Follow-up reported |
|---|---|
| LRU cache with O(1) get and put | Thread safety, expiry, then spread across machines |
| Clone a doubly linked list with an extra pointer per node, with your own Node class | Do not forget the left and right links |
| Minimum ship capacity to deliver packages within D days | Get the search bounds right |
| Is a linked list a palindrome, in O(1) space? | Restore the list afterwards |
| Spiral matrix | Counter-clockwise; generate an n by n spiral |
| Sizes of connected regions in a binary image | DFS depth on large inputs; use BFS |
| Shortest substring containing every vowel | Brute force, then sliding window, then dry run |
| Implement a vector, or a map with put, get and delete, without the STL | Space-saving version with a linked list |
More questions: Browse Microsoft questions.
Design rounds (low-level and high-level)
At a glance
- Length: about an hour; sometimes inside a coding round
- Questions per round: 1 design with many follow-ups
- What was asked: class design with code, distributed storage, games, monitoring dashboards
- Most common: a log storage system; a top-K system
Questions candidates reported:
| Question (our summary) | What the interviewer focused on |
|---|---|
| Store and read back a huge stream of log records | Partitioning, metadata, readers seeing new data |
| Online tic-tac-toe with REST APIs only | Matchmaking, scaling, multiple regions |
| Monitor lab machines running compute jobs | Job states, logs for crashes and hangs, remote reboot |
| A Windows notification system, with an AI assistant | How you prompt and check the AI's answer |
| Find restaurants within 10 km | Proximity search, then code part of it |
| Cut costs across microservices that call each other | Hiring manager design discussion |
More questions: Browse Microsoft questions.
The AA (As Appropriate) round
At a glance
- Length: about an hour
- Questions per round: 4 to 6 behavioral questions, sometimes a design question
- What was asked: judgment, past designs, disagreements, why you are leaving, working style
- Most common: a design you got wrong; a disagreement with a PM or teammate
How it works. With a senior engineer or manager, usually last. It is mostly behavioral, but candidates got a top-K design or a live data stream design in the second half. One candidate was asked in depth what they disliked about their current job.
Questions candidates reported:
- The best-designed system you worked on, and something you designed wrong.
- A disagreement with a PM and how you handled it.
- How you would get up to speed in a domain you know nothing about.
- How you decide whether a technical proposal is worth doing.
- Missing a deadline; being blocked for a long time; negative feedback.
- Your ideal working style and the manager who would suit you.
More questions: Browse Microsoft questions.
Stage 5: Decision and offer
How it works. Some candidates heard the next day; others saw the status change to "not selected" four days later. Senior processes took weeks to months. One senior candidate was down-levelled from 64 to 63 after a weaker coding round. One candidate negotiated a better package without a competing offer.
Microsoft experiences shared on Codinzhub
| College | Role and result | What was asked |
|---|---|---|
| IIT BHU | SDE intern, selected | Find every valid date in a string; debug a C++ student database with 15 bugs |
| IIT Delhi | SDE intern, selected | Minimum platforms for trains; LRU cache; projects |
| IIT Guwahati | SDE intern | Two DSA problems and a resume grilling; a managerial round |
| MNNIT | SDE intern, not selected | Nodes at distance K in a binary tree; OOP, DBMS and OS |
| Not stated | SDE 1 | Add two linked lists; validate a BST; build a map from scratch |
The Codinzhub Next-Round Playbook
What Microsoft candidates who moved on did. Put together by the Codinzhub team from the Microsoft experiences in this guide.
To get past the OA
- Practise renamed coding-practice mediums under time pressure. Contests helped more than untimed practice, one campus candidate said.
- When a DP times out, check whether binary search on the answer works.
To get past the coding rounds
- Pull helper methods out and name things clearly. Candidates got positive feedback on code organisation.
- Call out edge cases before you write them, such as a single row in a spiral matrix.
- Do not mutate the caller's data, or say how you would restore it.
- Prepare follow-ups that change the dimension: single machine to concurrent, stateless to expiring, one machine to many.
To get past the design rounds
- State functional and non-functional requirements first, then trade-offs.
- For AI-assisted rounds, practise prompting and checking an AI's output out loud.
To get past the AA round
- Have your own framework for judgment questions, such as deciding whether a proposal is worth doing.
- Prepare an honest answer to why you are leaving your job.
FAQ
Is there a cool-off period at Microsoft?
Candidates said no, so you can apply to several teams at once.
Is system design asked for new grads?
Rarely. Campus and new grad loops were coding, projects and fundamentals. SDE II and above added low-level and high-level design.
About this guide
This guide is researched and written by the Codinzhub team. We read every Microsoft interview experience we could find, kept only what candidates actually described, and rewrote it in our own words. Questions are our own short summaries; the practice links point to similar problems, not the exact interview questions. Found something out of date? Share your own experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.