microsoft logo
Microsoft· SDE II

Microsoft | SDE2 | Hyderabad/Noida | March 2026 [Selected]

Location
Hyderabad/Noida
Experience
3.5 years
Posted
28 Mar 2026
321 reads

Summary

I interviewed for an SDE2 role at Microsoft in Hyderabad/Noida in March 2026 and was selected after four rounds covering DSA, low‑level design, high‑level design, and a hiring‑manager discussion.

How it went

Status: SDE2 at Mid-sized Product Co.

Experience: 3.5 Years

Position: SDE2 (L61/L62)

Location: India (Remote/Hybrid)

Date: March 2026

Round 1: DSA & Problem Solving

  • Question 1: LeetCode 124 (Binary Tree Maximum Path Sum).
  • Question 2: (Similar to Trapping Rain Water 3d).
  • Details: The interviewer was very focused on Edge Cases (e.g., all negative nodes in the tree). We spent the last 10 minutes discussing how to unit test these scenarios.

Round 2: Low-Level Design (LLD) / Machine Coding

  • Task: Design a Task Scheduling System (like Cron/Airflow).
  • Requirements:
    • Support one-time and recurring tasks.
    • Handle task dependencies (Task B starts after Task A).
    • Thread-safety for concurrent execution.
  • Focus: Used the Observer Pattern for status updates and a Directed Acyclic Graph (DAG) to model dependencies. Clean code and SOLID principles were a must.

Round 3: High-Level Design (HLD)

  • Task: Design Microsoft Teams Messaging Infrastructure.
  • Key Areas:
    • Real-time delivery: WebSockets vs. Long Polling.
    • Scalability: How to handle a group chat with 10k+ users?
    • Storage: Partitioning strategy for chat history (NoSQL/Cassandra).
  • Deep Dive: Discussed Sequence Numbers vs. Timestamps for message ordering in a distributed environment.

Round 4: AA (As Appropriate) / Hiring Manager

  • Focus: Cultural fit and "Growth Mindset."
  • Discussion:
    • "Tell me about a time you mentored a junior and it didn't go well."
    • "How do you handle technical debt when there is a deadline?"
  • Technical: Brief discussion on microservices observability (tracing and metrics) to gauge my interest in operational aspects.

Final Verdict: Selected.

Questions asked (1)

  1. 01

    Binary Tree Maximum Path Sum

    Data Structures & Algorithms · Hard

    Given a binary tree, find the maximum sum of the values along any path. A path can start and end at any node in the tree, and must consist of a sequence of parent-child connections. Edge cases include trees where all node values are negative, requiring careful handling to ensure the maximum sum is correctly identified. The interview emphasized discussing how to unit‑test such edge cases.

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!