Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 25. Reverse Nodes in k-Group | Hard | ||
| 218. The Skyline Problem | Hard | ||
| 616. Add Bold Tag in String | Medium | ||
| 582. Kill Process | Medium | ||
| 64. Minimum Path Sum | Medium | ||
| 15. 3Sum | Medium | ||
| 560. Subarray Sum Equals K | Medium | ||
| 1539. Kth Missing Positive Number | Easy | ||
| 128. Longest Consecutive Sequence | Medium | ||
| 1259. Handshakes That Don't Cross | Hard | ||
| ๐ | 269. Alien Dictionary | Depth-First SearchBreadth-First SearchGraph | Hard |
| ๐ | 1966. Binary Searchable Numbers in an Unsorted Array | Binary Search | Medium |
| ๐ | 97. Interleaving String | Dynamic Programming | Medium |
| ๐ | 546. Remove Boxes | BacktrackingDynamic Programming | Hard |
| ๐ | 769. Max Chunks To Make Sorted | Misc.Basic DSA | Medium |
| ๐ | 3433. Count Mentions Per User | Basic DSASimulation | Medium |
| ๐ | 470. Implement Rand10() Using Rand7() | Basic DSA | Medium |
| ๐ | 2858. Minimum Edge Reversals So Every Node Is Reachable | Depth-First SearchBreadth-First SearchGraphDynamic Programming | Hard |
| ๐ | 1245. Tree Diameter | Depth-First SearchBreadth-First SearchGraph | Medium |
| ๐ | 430. Flatten a Multilevel Doubly Linked List | Depth-First SearchBasic DSA | Medium |
| ๐ | 1. Two Sum | Basic DSA | Easy |
| ๐ | 253. Meeting Rooms II | Misc.Two PointersBasic DSA | Medium |
| ๐ | 10. Regular Expression Matching | BacktrackingDynamic Programming | Hard |
| ๐ | 2678. Number of Senior Citizens | Basic DSA | Easy |
| ๐ | 5. Longest Palindromic Substring | Two PointersDynamic Programming | Medium |
| ๐ | 257. Binary Tree Paths | Depth-First SearchBacktracking | Easy |
| ๐ | 1021. Remove Outermost Parentheses | Basic DSA | Easy |
| ๐ | 139. Word Break | Adv. Data StructureBacktrackingDynamic Programming | Medium |
| ๐ | 353. Design Snake Game | Simulation | Medium |
| ๐ | 152. Maximum Product Subarray | Dynamic Programming | Medium |
| ๐ | 316. Remove Duplicate Letters | Misc. | Medium |
| ๐ | 759. Employee Free Time | Basic DSA | Hard |
| ๐ | 1405. Longest Happy String | Misc. | Medium |
| ๐ | 1647. Minimum Deletions to Make Character Frequencies Unique | Misc.Basic DSA | Medium |
| ๐ | 273. Integer to English Words | Backtracking | Hard |
| ๐ | 1822. Sign of the Product of an Array | Basic DSA | Easy |
| ๐ | 146. LRU Cache | Basic DSA | Medium |
| ๐ | 1239. Maximum Length of a Concatenated String with Unique Characters | Backtracking | Medium |
| ๐ | 200. Number of Islands | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| ๐ | 1304. Find N Unique Integers Sum up to Zero | Basic DSA | Easy |
| ๐ | 1448. Count Good Nodes in Binary Tree | Depth-First SearchBreadth-First Search | Medium |
| ๐ | 186. Reverse Words in a String II | Two Pointers | Medium |
| ๐ | 138. Copy List with Random Pointer | Basic DSA | Medium |
| ๐ | 1386. Cinema Seat Allocation | Misc. | Medium |
| ๐ | 722. Remove Comments | Basic DSA | Medium |
| ๐ | 277. Find the Celebrity | GraphTwo Pointers | Medium |
| ๐ | 445. Add Two Numbers II | Basic DSA | Medium |
| ๐ | 348. Design Tic-Tac-Toe | Simulation | Medium |
| ๐ | 545. Boundary of Binary Tree | Depth-First Search | Medium |
| ๐ | 54. Spiral Matrix | Simulation | Medium |
| ๐ | 297. Serialize and Deserialize Binary Tree | Depth-First SearchBreadth-First Search | Hard |
| ๐ | 642. Design Search Autocomplete System | Depth-First SearchAdv. Data StructureBasic DSA | Hard |
| ๐ | 1344. Angle Between Hands of a Clock | Basic DSA | Medium |
| ๐ | 836. Rectangle Overlap | Basic DSA | Easy |
| ๐ | 116. Populating Next Right Pointers in Each Node | Depth-First SearchBreadth-First SearchBasic DSA | Medium |
| ๐ | 42. Trapping Rain Water | Two PointersDynamic ProgrammingMisc. | Hard |
| ๐ | 17. Letter Combinations of a Phone Number | Backtracking | Medium |
| ๐ | 1615. Maximal Network Rank | Graph | Medium |
| ๐ | 103. Binary Tree Zigzag Level Order Traversal | Breadth-First Search | Medium |
| ๐ | 2. Add Two Numbers | BacktrackingBasic DSA | Medium |
| ๐ | 240. Search a 2D Matrix II | Binary SearchMisc. | Medium |
| ๐ | 419. Battleships in a Board | Depth-First Search | Medium |
| ๐ | 165. Compare Version Numbers | Two Pointers | Medium |
| ๐ | 468. Validate IP Address | Basic DSA | Medium |
| ๐ | 285. Inorder Successor in BST | Depth-First Search | Medium |
| ๐ | 23. Merge k Sorted Lists | Basic DSAMisc. | Hard |
| ๐ | 151. Reverse Words in a String | Two Pointers | Medium |
| ๐ | 53. Maximum Subarray | Misc.Dynamic Programming | Medium |
| ๐ | 460. LFU Cache | Basic DSA | Hard |
| ๐ | 706. Design HashMap | Basic DSAAdv. Data Structure | Easy |
| ๐ | 794. Valid Tic-Tac-Toe State | Basic DSA | Medium |
| ๐ | 510. Inorder Successor in BST II | Basic DSA | Medium |
| ๐ | 588. Design In-Memory File System | Adv. Data StructureBasic DSA | Hard |
| ๐ | 212. Word Search II | Adv. Data StructureBacktracking | Hard |
| ๐ | 171. Excel Sheet Column Number | Basic DSA | Easy |
| ๐ | 4. Median of Two Sorted Arrays | Binary SearchMisc. | Hard |
| ๐ | 140. Word Break II | Adv. Data StructureBacktrackingDynamic Programming | Hard |
| ๐ | 8. String to Integer (atoi) | Basic DSA | Medium |
Sign up for free to track your progress, then upgrade to Pro for all 78 questions with detailed solutions.
Sign Up FreeAt Microsoft, the software engineering interview process begins with a resume screening, followed by one or two Online Assessments (OAs) focusing on coding and problem-solving skills. This initial screening is crucial to advancing to the next stages.
Successful candidates then proceed to a phone interview, often involving coding challenges and technical questions. Highly competitive, the process culminates in several onsite rounds that evaluate coding proficiency, algorithmic skills, and cultural fit with Microsoft's dynamic work environment.
At Microsoft, the initial screening involves a thorough review of resumes, focusing on relevant experience and specific technical skills. Typically, candidates may also face automated online assessments (OAs) to gauge coding and problem-solving skills.
Following the resume and OA, a recruiter may conduct a preliminary screening call. This discussion usually touches on the candidateโs background, interests, and alignment with Microsoftโs core values and technology focus.
At Microsoft, the interview process typically includes one or two phone screens. These initial calls are designed to assess your technical skills through coding exercises and algorithm questions, as well as a review of your previous projects and experiences.
The phone interviews are not just about coding; they also evaluate your problem-solving approach and your ability to communicate effectively. It's a great opportunity to demonstrate how you tackle challenges and think through solutions.
During Microsoft's onsite interview rounds, candidates typically face four to five interviews. These sessions are a blend of coding, system design, and behavioral questions, designed to assess both technical proficiency and cultural fit.
The interviews are usually conducted back-to-back, with each lasting about 45 minutes to an hour. Candidates may also be asked to solve problems on a whiteboard, showcasing their ability to think and code under pressure.
Post-interview at Microsoft, candidates may undergo team matching and final reviews. This phase could include meetings with executives, and the offer stage allows for negotiation on the terms of employment.

When gearing up for a Microsoft software engineering interview, it's crucial to acquaint oneself with a broad array of coding problem patterns. Basic DSA, Backtracking, and Two Pointers emerge as the most common problem types. However, Microsoftโs coding interviews seem to have a slightly higher than usual inclination towards Backtracking problems compare to other companies. It is also interesting to note smaller but still crucial segments like Graphs and Simulation, which are less frequently encountered but could be decisive in securing the job. This variety demands a well-rounded preparation strategy beyond the typical focus areas.
Tell me about a time when you had to learn a new technology to complete a project. How did you approach it?
Describe a situation where you had to work collaboratively with others on a complex coding project.
Can you provide an example of a time when you faced a significant challenge in your project? How did you handle it?
Describe a time when you had to work collaboratively with a team to solve a complex problem. What was the challenge, what role did you play, and what was the outcome?
How do you handle a situation where a team member is not contributing effectively?
Microsoft values innovation. Can you share an experience where you innovated within a team setting to improve a process or product?
Describe a time when you had to use your engineering skills to solve a problem that had a tight deadline.
Can you talk about a project where you implemented a technology that was new to you? How did you ensure its successful integration?
Knowing that Microsoft prioritizes seamless user experience, describe how you have developed software in the past that anticipates and solves user needs before they become issues.