**Round 1 : DSA Round (1 hour)**\n\tProblem 1: Number of minimum meeting rooms required for all the meeting to happen \n\tmeeting is with given time frame: [start-time, end-time]\n\tsolved the solution firstly using prefix sum \n\tthen solved it using heaps\n\tProblem 2: https://leetcode.com/problems/meeting-rooms-iii/\n\tTold the approach, wasn\'t able to code it because interview was about to end\n\tAsked few questions on Redis, Kafka, Sns, SQS (mentioned in my resume)\n\n**Round 2: Designing Round (1 hour)**\n\thad discussion over myh projects in current company, Kafka, SQS for 30 - 35 minutes. then he gave me problem where we need to iterate over a given tree in such a way that print value of 1st level nodes from left to right, then print value of next 2 level nodes i.e (level -2,3) from right to left then print value of next 3 level nodes i.e (level - 4,5,6) from left to right then next 4 level nodes from right to left and so on.\ni explained my approach, he seems satisfied but left with only 15 minutes to code. interviewer told me to send the code in 5 minutes after the interview which i agreed to as my code was almost complete, however while sending the code i mistakenly closed my tab in which code was written, which took me extra 15 minutes to send the code\n\nreceived result in 2 dyas\n**Verdict : Reject**

Round 1 : DSA Round (1 hour)\n\tProblem 1: Number of minimum meeting rooms required for all the meeting to happen \n\tmeeting is with given time frame: [start-t