Microsoft SWE Intern, Early 2025: 41 Experiences (Part 5 of 6)
- Company
- Microsoft
- Reports
- 41 interview reports
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Microsoft SWE intern reports from January to June 2025, the earliest in the series: more graph questions than any other part, and a Codility OA.
At a glance
- Process: OA and home assessments, phone screens, then interview rounds; a January 2025 OA on Codility is described by two, very likely three, candidates.
- Asked: graph questions in 12 of these 41 reports, from Word Ladder and Number of Islands to a one-way-roads OA task; résumé and project questions in 20; building a data structure (LRU cache, setAll map, queue from stacks, hash map) in 9.
- More: the question tables for all 232 reports, the regional notes and the patterns are in Part 1.
Coverage: Internship cohort, Software Engineering Intern role, reports 192–232, dated January 2025 to June 30, 2025, plus one dated only to 2025. None is from the Security & Identity internship. Locations: India 12, Israel 7, US 5, not stated 4, China 4, Egypt 3, and one each from Denmark, Canada, Serbia, Spain, the UK and Qatar. Stages: OA and home assessments, phone screens, interview rounds and finals. Dates are report dates unless a report gives an interview or OA date; fourteen reports carry only a month, a period or a year.
In this series
- Part 1: Software Engineering Intern reports 01–48, July to November 2026. Also has the overview, question tables, regional notes and patterns for all 232 Software Engineering Intern reports.
- Part 2: Software Engineering Intern reports 49–102, January to June 2026.
- Part 3: Software Engineering Intern reports 103–149, October to December 2025.
- Part 4: Software Engineering Intern reports 150–191, July to September 2025.
- Part 5 (current): Software Engineering Intern reports 192–232, January to June 2025 (plus one dated only to 2025).
- Part 6: The other internship programs: Explore Intern (1 report), Student Software Engineer roles in Israel and Denmark (10) and one SWE Co-op (1).
What came up
Graphs show up more in this stretch than anywhere else in the series: 12 of these 41 reports, from Word Ladder and Number of Islands to a one-way-roads OA task. Resume and project questions came up in 20, and 9 asked candidates to build a data structure such as an LRU cache, a setAll map, a queue from stacks or their own hash map.
| Topic | Reports | Last seen |
|---|---|---|
| Resume, project and past-internship deep dives | 20 of 41 | May 2025 (report date) |
| Behavioral and motivation questions | 13 of 41 | Jun 2025 (report date) |
| Graphs, BFS/DFS and dependency ordering | 12 of 41 | May 2025 (report date) |
| Design a data structure or class (LRU, trie, setAll, hash map) | 9 of 41 | May 2025 (report date) |
| CS fundamentals (OS, OOP, DBMS, networks) | 9 of 41 | May 2025 (report date) |
| Trees, BSTs and tries | 6 of 41 | May 2025 (report date) |
| Dynamic programming | 5 of 41 | May 2025 (report date) |
| Arrays and hashing | 5 of 41 | Apr 2025 (report date) |
| Linked lists | 5 of 41 | Apr 2025 (report date) |
| Strings | 4 of 41 | May 2025 (report date) |
| Stacks, queues and heaps | 4 of 41 | Apr 2025 (report date) |
| System and low-level design | 4 of 41 | Apr 2025 (report date) |
| Binary search | 3 of 41 | Apr 2025 (report date) |
| Sliding window and two pointers | 3 of 41 | Apr 2025 (report date) |
| Greedy and backtracking | 3 of 41 | Apr 2025 (report date) |
| Grids and matrices | 2 of 41 | May 2025 (report date) |
| Math, bits and puzzles | 1 of 41 | May 2025 (report date) |
A report can count toward several topics. The counts use this part's 41 reports.
Questions we found
These tables cover only this part's 41 reports. Part 1 has the tables for all 232 Software Engineering Intern reports.
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Flip one-way roads so every city reaches city 0 | 2 reports (possibly one candidate) | Reports: 2025-01-02 (OA date); Additional FastPrep history: 2024-07-24 |
| LRU Cache | 3: 195, 209, 230 | May 2025 (report date) |
| Map with O(1) get, set and setAll | 2: 206, 229 | Apr 2025 (report date) |
| Implement a queue using stacks | 2: 211, 218 | Mar 2025 |
| Word Ladder | 1: 193 | May 2025 |
| Check that every node equals its subtree sum | 1: 193 | May 2025 |
| Valid Anagram | 1: 195 | May 2025 |
| Shortest Bridge | 1: 198 | May 2025 |
| Task chain balancer (OA task) | 1: 200 | Apr 2025 |
| Equalize server latency (OA task) | 1: 200 | Apr 2025 |
| Convert a float to a string without built-ins | 1: 202 | Apr 2025 |
| Match a string against a pattern | 1: 213 | Mar 2025 |
| Find the upstream tasks behind a failure | 1: 213 | Mar 2025 |
| Reverse a linked list | 1: 214 | Mar 2025 |
| Open the Lock | 1: 214 | Mar 2025 |
| Number of Islands | 1: 216 | Mar 2025 (report date) |
| Gas Station | 1: 214 | Mar 2025 |
| Exclusive Time of Functions | 1: 215 | Mar 2025 |
| K-length fragment (OA task) | 1: 220 | Feb 2025 |
| Height skyscraper (OA task) | 1: 220 | Feb 2025 (report date) |
| Implement a self-balancing BST | 1: 224 | Jan 2025 |
| Serialize and Deserialize Binary Tree | 1: 226 | Jan 2025 |
| Implement DFS on a graph | 1: 225 | Jan 2025 |
| Metro fare with a daily cap | 1: 227 | Jan 2025 |
| Valid Parentheses | 1: 229 | Jan 2025 (report date) |
| Permutation in String | 1: 229 | Jan 2025 |
| Intersection of two linked lists | 1: 229 | Jan 2025 (report date) |
| Find Pivot Index | 1: 229 | Jan 2025 |
| Write your own hash map class with O(1) operations | 1: 223 | early 2025 |
| Two-player pick game where an even pick reverses the rest | 1: 232 | 2025 |
| OA problem similar to House Robber | 1: 232 | 2025 |
Multiple choice (OA)
| Question | Reports | Last seen |
|---|---|---|
| Multiple-choice set: OOP keywords, limited-memory search, cache eviction, stock-price range queries, age validation | 1: 200 | Apr 2025 |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a file system and find a file's path | 1: 226 | Jan 2025 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Design a scalable file storage service | 1: 204 | Apr 2025 |
| Design Snap Lens Studio end to end | 1: 223 | early 2025 |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Tell me about yourself | 3: 194, 202, 205 | May 2025 |
| Your favorite Microsoft product (practice) | 1: 192 | Jun 2025 |
| Your most memorable college experiences (practice) | 1: 193 | May 2025 |
| Why Microsoft? / Why do you want to join Microsoft? (practice) | 1: 193 | May 2025 (report date) |
| Front-end, back-end or algorithms? (practice) | 1: 212 | Mar 2025 |
| A technical challenge, or the hardest problem you solved (practice) | 1: 212 | Mar 2025 |
| Why a SWE job rather than an AI job? | 1: 217 | Mar 2025 |
| A past internship project you found hard | 1: 217 | Mar 2025 |
CS fundamentals (concept questions)
| Question | Reports | Last seen |
|---|---|---|
| Explain recursion to a child or a non-technical person | 1: 197 | May 2025 |
41 detailed candidate timelines, loops, and screens
192: Denmark — a take-home, HR, three technical rounds and a manager chat
Report date: 2025-06-30 · Role: Software Engineer Intern · Location: Denmark · Result: Offer
At-home coding challenge
HR interview
Three back-to-back technical interviews, then a hiring manager chat
193: India campus drive — VS Code screen share, then Codility for Word Ladder
Report date: 2025-05-31 (summer 2025 internship) · Role: Software Engineering Intern · Location: India (on-campus) · Result: Offer by phone
OA (2 questions; finishing time also counted)
- A grid problem that needed careful case handling with many branches.
- A DP problem that followed a standard pattern.
Interview 1, technical and behavioral (screen share in their own VS Code; the interviewer was fine with turning AI extensions off)
- Check that every node's value equals the sum of its subtree. The report doesn't say whether the node itself counts. They used a basic DFS and had to bring their own test cases.
- Their projects and what could be improved.
Interview 2, behavioral and technical (on Codility)
- Why they wanted to join Microsoft, and their most memorable college experiences.
- Word Ladder: they explained why brute force is slow, coded the BFS, and derived the time complexity step by step.
- Challenges they hit in their projects.
194: US — a matrix problem and a reworded tree problem
Report date: 2025-05-30 · Role: Software Engineer Intern · Location: United States · Result: No offer
Two back-to-back interviews (technical plus behavioral)
- A matrix problem close to a well-known practice problem.
- A tree problem worded differently from the usual version.
- Tell me about yourself.
195: Herzliya — an online interview day with an O(1) LRU cache
Report date: 2025-05-25 · Role: Software Engineer (Internship) · Location: Herzliya, Israel · Result: No offer
Home assessment (2 medium problems)
Online interview day (three interviews)
- A warm-up: Valid Anagram.
- Implement an LRU cache class with O(1) operations.
- OOP questions.
196: Cairo — a very hard bit-manipulation OA
Report date: 2025-05-19 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Result: No offer
Online assessment (HackerRank)
- A bit-manipulation question the candidate called very hard.
197: Vancouver — explain recursion to a non-engineer
Report date: 2025-05-18 · Role: Software Engineer (Internship) · Location: Vancouver, Canada · Result: No offer
Phone interview
- Explain recursive functions to someone non-technical.
- General tech questions, behavioral questions, projects and teammates.
198: Serbia — Shortest Bridge
Report date: 2025-05-09 · Role: Software Engineer (Internship) · Location: Serbia · Result: No offer
Online test
Online technical interviews
- Shortest Bridge (DFS/BFS, medium).
199: Cairo — a medium and a hard, then every line of the resume
Report date: May 2025 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Result: No offer
Round 1, problem solving (45 minutes, 2 problems: one medium, one hard)
Round 2, behavioral (45 minutes)
- Every detail of the resume.
200: Relational Database team OA — five multiple-choice questions and two hard tasks
Report date: 2025-04-25 · Role: Intern 2025, Relational Database team (per the title) · Location: Not stated · Channel: Applied online · Result: Pending when posted
Online assessment
Five multiple-choice questions: when to use particular OOP keywords, searching with limited memory (linear vs. binary search), how to implement cache eviction, range queries over stock prices, and validating a user's age.
Two coding problems, known only by their short titles; the candidate found them hard:
- Equalize server latency.
- Task chain balancer.
201: Haifa — Codility home test and four mediums in a day
Report date: 2025-04-24 · Role: SWE Intern · Location: Haifa, Israel · Result: No offer
Home assessment (Codility, 2 greedy problems)
Three interviews on the same day
- Four medium problems across the day: sliding window, greedy, DFS and BFS.
- An OOP discussion.
202: Bengaluru — a stack problem, networks, and a float-to-string
Report date: 2025-04-15 · Role: SDE-intern · Location: Bengaluru, India · Result: No offer
Online assessment (2 problems)
Technical 1 (one-on-one)
- Tell me about yourself and your projects.
- DBMS (atomicity) and time management.
- A stack problem, partly solved.
Technical 2, final (one-on-one)
- Computer networks.
- Convert a floating-point number to a string without built-in methods.
203: Bengaluru — Dijkstra and a linked list
Report date: 2025-04-15 · Role: SDE-intern · Location: Bengaluru, India · Result: No offer
Interview
- A graph problem that needed Dijkstra's algorithm.
- A linked-list question.
204: Egypt — design a file storage service
Report date: 2025-04-06 · Role: Software Engineer (Internship) · Location: Egypt · Result: No offer
Online assessment
Technical interview(s)
- Design a scalable file storage service: the backend structure, how to handle large files, and staying reliable under load.
205: US — two finals, one coding question each
Report date: April 2025 · Role: Software Engineering Internship · Location: United States · Result: No offer
Two back-to-back final interviews
- Tell me about yourself and your experience.
- A coding question in each interview (not named).
206: Tel Aviv — setAll in O(1) again
Report date: April 2025 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Result: No offer
Three interviews on the same day, each with a different team member
207: Barcelona — three half-and-half finals, then silence
Report date: 2025-03-29 · Role: Software Engineering Intern · Location: Barcelona, Spain · Result: No offer
Online technical screen
Three finals, each half behavioral and half coding
- Rebuild a data structure from scratch.
- A graph problem.
- A third, easier problem they don't remember.
No reply four months later; the outcome is recorded as no offer.
208: Hyderabad — a linked list, then all the core subjects
Report date: 2025-03-25 · Role: SDE-intern · Location: Hyderabad, India · Result: Offer
Interview 1
- A medium linked-list question.
- A short project discussion.
Interview 2 (same day)
- OOP, OS, networking and DBMS fundamentals, plus one DSA question.
209: Bengaluru — an LRU cache in the OA
Report date: 2025-03-24 · Role: Software Development Engineer (SDE) Intern · Location: Bengaluru, India · Result: No offer
Online assessment (2 problems)
210: Shanghai summer intern — four coding problems over two rounds
Report date: week of 2025-03-14 · Role: Summer intern, software development · Location: China (Shanghai) · Result: Not selected
There were no rote fundamentals. Both rounds were resume questions plus two coding problems.
Round 1 (deep resume questions)
- A binary search problem.
- A DFS problem.
Round 2 (team lead, who gave a lot of hints)
- A two-pointer problem.
- A linked-list manipulation problem.
They finished only one of the two in round 2.
211: Beijing, Microsoft AI (MAI) — a pooled first round and a queue made of stacks
Interview date: 2025-03-11 · Role: Software Engineer Intern · Team: Microsoft AI (MAI) · Location: China (Beijing) · Result: Not selected after round 1
They applied in early February, filled in a questionnaire in mid-February and were invited in late February. Everyone in this cycle went through one pooled first round before being matched to a direction.
Round 1
- A resume review focused on how AI-related their background was: papers and research.
- Implement a queue using stacks. Mostly accepted.
- A brain-teaser-style algorithm question they couldn't solve.
212: Beijing summer intern studying in the US — round 1 in Chinese, camera off
Interview date: 2025-03-10 or 11 · Role: SWE summer intern · Team: MAI, per the candidate's earlier post · Location: Beijing, China · Result: Waiting on the final round when posted
Round 1 (video call; the interviewer's camera was off; all in Chinese)
- Short background questions and a self-intro, then one internship or project in depth.
- Whether they lean toward front-end, back-end or algorithms, and the biggest difficulty they'd faced and how they solved it.
- Two coding problems, one a well-known standard problem and one a variant: a binary search problem (solved) and a two-pointer problem (solved, but not optimally; they explained the better idea).
The result was promised the next day, with a final round later that week if they passed.
213: Beijing summer intern — pattern matching and a failure trace
Interview date: 2025-03-10 · Role: Software development summer intern · Location: Beijing, China · Channel: Careers site · Result: Offer
Round 1, coding (shared web editor; prompts in English, conversation in Chinese; booked for 45 minutes and ran over an hour; no self-intro or resume questions)
- Match a string against a pattern. The exact pattern rules aren't given. They started with DP; the interviewer steered them toward recursion, and it passed the tests without KMP.
- Find the upstream tasks behind a failure: a business-style troubleshooting task with a real file to read. The interviewer kept raising possible bugs for them to handle. They ran out of time and only described the approach.
Final round (not described), then an offer.
214: India off-campus — linked list, Open the Lock, and a brute-force Gas Station
Interview date: March 2025 · Role: Software Engineering Intern (off-campus) · Location: India · Result: Rejected after the second interview, no feedback
Resume screen, then OA (2 medium-to-hard problems; all tests passed)
Technical interview (live coding)
- Reverse a linked list, both iteratively and recursively, with time and space for each.
- Open the Lock: brute force first, then BFS, then a faster approach and changes for edge cases.
- Tree traversals: BFS vs. DFS, and how to walk a tree to check conditions.
- A problem that mixed backtracking and BFS, coded live.
The interviewer looked for clear explanations, debugging and taking hints well.
Behavioral and technical interview (30–45 minutes)
- Project work, answered STAR-style.
- Gas Station, brute force only, then its complexity and how to optimize it. Coded live; all tests passed.
215: Hyderabad — Exclusive Time of Functions
Report date: March 2025 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Result: Offer
Two DSA rounds on the same day
- Exclusive Time of Functions.
- Past projects: how they were built and what impact they had.
216: Hyderabad — Number of Islands and OS questions
Report date: March 2025 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Result: No offer
Online assessment
Technical interview
- Number of Islands.
- Core subjects, especially operating systems.
- Introduction, resume, projects and internships.
217: Redmond — why SWE and not AI?
Report date: March 2025 · Role: Software Engineer Intern · Location: Redmond, Washington, US · Channel: HR reached out · Result: Offer
HR reached out first.
Round 1 (45 minutes)
- One medium coding problem.
- About 20 minutes of resume and behavioral questions, including a past internship project they found hard.
Round 2 (45 minutes, back to back)
- Two medium coding problems.
They were also asked why they wanted a SWE job rather than an AI job.
218: Israel referral — Codility OA and a queue from stacks
Report date: March 2025 · Role: Software Engineer Intern · Location: Israel · Channel: Referral · Result: Offer
Online assessment (Codility, 2 medium problems)
Online interview day (three interviews)
- Implement a queue using only stacks, in any language.
- Questions on CV projects.
219: India — arrays and DP over two rounds
Report date: March 2025 · Role: Software Engineer (Internship) · Location: India · Result: Offer
Round 1, DSA and Round 2, DSA and resume
- Two array questions and one DP question across the rounds.
220: Israel — a 100-minute code test with two titled tasks
Report date: 2025-02-28 · Role: Software Engineer (Internship) · Location: Israel · Result: No offer
Code test (100 minutes, 2 tasks; only their titles are known)
- A task known by its title, height skyscraper.
- A task known by its title, K-length fragment.
221: Tel Aviv — take-home, then six problems over three interviews
Report date: 2025-02-27 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Result: No offer
Take-home test (2 problems)
Three 90-minute interviews (two algorithm questions each, not named)
222: UK — design the interviewer's project
Report date: 2025-02-14 · Role: Software Engineer (Internship) · Location: United Kingdom · Result: Offer
Interviews (round count not given; interviewers had cameras off)
- The interviewer described a project; explain how you would design it.
The candidate didn't enjoy the experience, got the offer and declined it.
223: Redmond, Azure Core — no OA, two back-to-back finals
Interview date: early 2025 · Role: Software Engineer Intern · Team: Azure Core · Location: Redmond, US · Channel: Recruiter outreach (applied the previous September, no referral) · Result: Offer
Phone screen (no details)
Final interview 1, DSA (virtual)
- A problem they hadn't seen before, solved in linear time with a stack and a hash map.
- Follow-up: instead of Python's dict, write your own hash map class, implement its methods and get the operations to O(1). They did.
Final interview 2 (after a 15-minute break)
- An easy, commonly practiced Microsoft problem, done in about 10 minutes.
- After questions on a resume project with Snapchat: design Snap Lens Studio, the tool creators use to build lenses, end to end in about 30 minutes on a whiteboard. Topics: what inputs it takes, the infrastructure pipeline, load balancing, how to split microservices, vertical vs. horizontal scaling, robustness, the trade-offs of indexing the database on a given field, and whether partitioning helps. High-level design first, then component deep dives.
- AWS vs. Azure trade-offs (the role was in Azure Core), including cost lessons from a past internship that used AWS Glue and Redshift.
224: Off-campus summer 2025 — the interviewer cut the BST short
Interview date: 2025-01-29 (OA on 2025-01-02) · Role: Summer Intern 2025 (SWE) · Location: Not stated · Channel: Applied, no referral · Result: Not selected
OA (2 questions): the first went quickly. The second threw a function-signature mismatch error even though they hadn't touched the signature. They were still shortlisted.
Interview 1 went well (no details); the call for the next round came within five minutes.
Interview 2
- Implement a self-balancing BST. They thought aloud and started coding; the interviewer stopped them midway, said he understood the approach, and wrapped up.
- The backend design of their internship project, explained verbally.
The rejection showed up on 2025-02-08. The OA date and the signature error match reports 227 and 228, so this was very likely the same OA set.
225: Bengaluru — DFS on a graph and fundamentals
Report date: 2025-01-05 · Role: SDE-intern · Location: Bengaluru, India · Result: No offer
Interview(s)
- Implement DFS on a graph.
- CS fundamentals.
226: US internship program — serialize a tree, then build a file system
Report date: 2025-01-05 · Role: Software Engineer · Location: United States · Result: No offer
Technical interviews 1 and 2
The posting carried the plain Software Engineer title, but the report says the process was for the internship program. Friends of the candidate had a group video call instead.
227: January 2025 OA set on Codility — metro fares and one-way roads
OA date: 2025-01-02 · Role: SWE Intern 2025 · Location: Not stated · Result: Solved both; waiting for interview calls when posted
The candidate shared both Codility task statements and spent about 1.5 hours on them.
- Metro fare with a daily cap: stations 0 to K−1 sit on one line. A ride costs 1 to board plus 2 per hop between neighboring stations. Given each ride's start and end for one day, the day's total is capped at limit[Y], where Y is the highest-numbered station visited. Return the charge. Up to 100 rides, 2–50 stations, caps up to 3,000; correctness mattered more than speed.
- Flip one-way roads so every city reaches city 0: N one-way roads join N+1 cities into a tree, given as arrays A and B. A hospital opens in city 0. Return the fewest roads to reverse so every city can drive to city 0. N goes up to 100,000, so it has to be efficient.
228: The same OA, with a compile error on the roads task
OA date: 2025-01-02 (reported 2025-01-03) · Role: SWE Intern 2025 · Location: Not stated · Result: Not stated
- Took the same two-task OA as report 227.
- On the one-way roads task they believed their logic was right, but a compile error on the function's type meant no tests passed.
Same date and same kind of error as report 224; the two may be the same person.
229: Tel Aviv — five problems across an interview day, including setAll
Report date: January 2025 · Role: Software Engineer Internship · Location: Tel Aviv, Israel · Channel: Referral · Result: Offer
Online assessment two months after applying.
Three back-to-back online interviews two months after that. Across the day:
- Valid Parentheses, with other characters mixed into the string.
- Is a permutation of one string a substring of another?
- Find where two linked lists intersect.
- Find the index where the sums on both sides are equal.
- An array with a setAll method in O(1).
- Prior experience and school projects.
The offer came a week after the interview day.
230: Qatar — an LRU cache variant after the behavioral warm-up
Report date: January 2025 · Role: Software Engineer (Internship) · Location: Qatar · Result: Offer
Two back-to-back 45-minute interviews (one problem each)
- Behavioral and resume questions before the coding.
- A variant of LRU Cache.
231: India — a graph and a hard DP in one round
Report date: January 2025 · Role: Software Engineering Intern · Location: India · Result: No offer
DSA round (2 problems, with behavioral questions alongside)
- A graph problem.
- A hard DP problem.
232: India on-campus OA — a House Robber variant and a reversing pick game
Date: 2025 (year only) · Role: Internship (SWE track implied) · Location: India (on-campus) · Result: Not shortlisted for interviews
OA (about 75 minutes; question sets differed between students, and many finished in about 20 minutes)
- A problem similar to House Robber. The twist isn't described.
- A two-player pick game: players take turns taking numbers from a list, and taking an even number reverses what's left. Return the difference between their scores. The candidate tagged it greedy. The report doesn't say which end a player takes from or whether players play optimally.
Common questions
What graph questions did Microsoft ask SWE interns in 2025?
Word Ladder, Number of Islands and a one-way-roads OA task, among 12 graph reports in this part.
Keep practicing
- Practice problems from reports 192–232, with the report numbers they came from: Check that every node equals its subtree sum (193); Word Ladder (193); Valid Anagram (195); LRU Cache (195, 209, 230); Shortest Bridge (198); Equalize server latency (OA task) (200); Convert a float to a string without built-ins (202); Design a scalable file storage service (204); Map with O(1) get, set and setAll (206, 229); Implement a queue using stacks (211, 218); Match a string against a pattern (213); Find the upstream tasks behind a failure (213); Reverse a linked list (214); Open the Lock (214); Gas Station (214); Exclusive Time of Functions (215); Number of Islands (216); Height skyscraper (OA task) (220); Write your own hash map class with O(1) operations (223); Design Snap Lens Studio end to end (223); Implement a self-balancing BST (224); Serialize and Deserialize Binary Tree (226); Design a file system and find a file's path (226); Metro fare with a daily cap (227); Flip one-way roads so every city reaches city 0 (227, 228); Valid Parentheses (229); Permutation in String (229); Intersection of two linked lists (229); Find Pivot Index (229); OA problem similar to House Robber (232); Two-player pick game where an even pick reverses the rest (232).
- Microsoft system design questions and Microsoft behavioral questions: the company question banks (sign-in needed).
- Microsoft interview page: Microsoft practice grouped by reported stage.
- Microsoft hiring insights: OA and interview insights for Microsoft.
- Experience feed: more interview reports and roundups.
In this series: Part 1 · Part 2 · Part 3 · Part 4 · Part 5 (current) · Part 6
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.