microsoft logo
Microsoft· SDE-2

Microsoft SDE-2 | Noida | Leetcode + DSA + Design + HM

Location
Noida
Posted
19 Jul 2025
275 reads

Summary

I successfully secured an SDE-2 offer at Microsoft in Noida after undergoing a comprehensive interview process covering Data Structures & Algorithms, System Design, and a Hiring Manager round. I am currently in compensation negotiation, having also received another offer from an MNC.

How it went

Online Assessment (OA): 2 DSA LC (Hard and Medium)

Round 1 (DSA Round 1):

  • Q1: BFS-based grid conversion — simulate a magician converting adjacent people in a grid (similar to Rotten Oranges Leetcode #994)
  • Q2: Find the smallest missing positive integer (Leetcode #41)

Round 2 (DSA Round 2):

  • Discussed a variation of closest pair with latency spikes (used heap + hashmap)
  • Follow-up on array transformations and optimization

Round 3 (Design Round):

  • Design a Logging Framework
  • Classes: LogTypeEnum, Log class, Output channels (DB, File, Console, Cloud)
  • Patterns: Singleton, Broadcast Channel Map, Interface-based output controllers
  • Emphasis on abstraction and extensibility

Round 4 (HM + Final Round):

  • Project Deep Dive: Discussed my past work on [brief description of a complex system you've built, e.g., fraud detection service or vehicle reassignment system]
  • HLD + LLD: Designed a notification service — pub-sub architecture, push vs pull, scaling strategies, reliability

Result:
✅ Offered SDE-2.
💰 Compensation: Negotiating
📍 Other Offer: Yes (MNC).

Questions asked (5)

  1. 01

    BFS-based Grid Conversion (Rotten Oranges Type)

    Data Structures & Algorithms · Medium

    Given a grid, simulate a magician converting adjacent people. This is a BFS-based grid conversion problem, similar to LeetCode #994 Rotten Oranges.

    Open the problem
  2. 02

    Find the Smallest Missing Positive Integer

    Data Structures & Algorithms · Hard

    Find the smallest missing positive integer.

    Open the problem
  3. 03

    Closest Pair Variation with Latency Spikes

    Data Structures & Algorithms

    Discussed a variation of the closest pair problem specifically involving latency spikes.

  4. 04

    Design a Logging Framework

    System Design

    Design a logging framework.

  5. 05

    Design a Notification Service

    System Design

    Designed a notification service, covering High-Level Design (HLD) and Low-Level Design (LLD).

How they prepared

Tips:

  • DSA: Stick to Leetcode mediums/hards. Focus on BFS/DFS, heap, sliding window, and edge cases.
  • Design: Practice real-world system designs and focus on modularity and extendability.
  • Behavioral: Be clear on your contributions in previous projects. HM round was friendly but thorough.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Microsoft recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!