Microsoft | SDE 2 | Noida, India | June 2026

Anonymous User
673
Jul 28, 2026
Jul 28, 2026

I applied through a referral and received a call from the recruiter. The interview was conducted online, with all rounds scheduled on the same day.

Role: Backend Engineer - SDE 2 (L62)
Location: Noida
Result: Rejected

🧱 Round 1: AI-Assisted Round (Low-Level Design - 1 Hour) (Excel Autofill Function)

This was a highly unique and interactive pair-programming round split into three distinct phases. Rather than just writing code from scratch, I had to architect a system, prompt an AI model (ChatGPT/Gemini) to generate it, and then critically audit the AI's output.

Problem Statement: Design an Excel-like autofill/aggregator functionality. When a user drags a cursor across a range of cells starting from a specific seed value:

  • If the seed is a Number, the subsequent cells should increment sequentially (1 → 2 → 3 → 4).
  • If the seed contains a Sequence of Characters, they should repeat or loop through a specific pattern (a, b, c, d → a, b, c, d).

Constraint: The system must be highly extensible adhering to SOLID principles so that adding future custom fills (e.g., Dates, Days of the week, Fibonacci sequences) requires zero changes to the core engine logic.

🧱 Round 2: Data Structures & Algorithms (1 Hour)

This round focused heavily on building a clean simulation and optimizing lookups using specialized data structures.

Problem Statement:Implement a prototype round-robin load-balancing algorithm for (n) servers numbered (1) to (n) handling (m) requests.

  • Each request (i) arrives at arrival[i] and takes a execution window of burstTime[i].
  • The load balancer assigns incoming request (i) to the available server with the absolute lowest index.
  • A server becomes busy/unavailable from its assignment time until it completes execution at arrival[i] + burstTime[i].
  • If no servers are available at arrival[i], the request is dropped and marked with -1.

Note: This is very similar to LeetCode 1606 - Find Servers That Handled Most Number of Requests but simplifies the allocation tracking to the global lowest index available rather than tracking circular offsets.

Comments (2)