Microsoft | SDE 2 | Hyderabad | JAN 2024 [PENDING]

Interview Process:

OA Round: The online assessment contained two questions:

1. A dynamic programming problem to find the number of rectangles in a matrix that have an equal number of 'A's and 'B's. Example Input: [A B *

• A B B * A]

2. A heap question to find the number of customers for whom a monitor is delivered. Two arrays were given: one with the number of monitors to serve each customer and the second with the distance and total number of monitors available (K). The task was to sort the array based on distance and fulfill orders from K. Example: Number of monitors: [2,4,6,4,7] Distance: [9, 2,4,7, 6] K: 10

I was able to solve both questions within the given time, with all test cases passing.

R-1: This was a one-hour round with a friendly interviewer. We spent 15 minutes discussing each other's work. The technical portion involved a DSA problem similar to "Convert Sorted Array to Binary Search Tree". I was asked to implement it in O(n) time and without recursion.

R-2: This round began with a brief introduction and discussion of my experience (10 minutes). The interviewer then asked me to provide approaches for LRU cache and design a low-level design for rate limiting, including follow-up questions.

HR indicated that if the feedback from the first two rounds was positive, there would be a third and fourth round. However, I did not receive further communication that day.