Status: MS CS\nExperience: ~3 years (Prior to Masters)\nDate: Aug - Oct 2020\n\n**Phone Screen**\n[Vertical Order Traversal Of Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/). I suggested the optimal approach and finished the coding part in around 20 minutes. It was followed by 10 minutes of discussion about the company.\n\n**Virtual Onsite**\n\n*First Round*\n1. [Number of Islands](https://leetcode.com/problems/number-of-islands). Interviewer said he won\'t mind if I have seen the question before, just code it up without any errors. I coded the standard DFS aprroach and suggested space optimization by changing the values of the original grid to -1 (if visited).\n2. Given 2 streams of integers that are sorted, write a function that returns the next integer in the sorted order. \n\n*Second Round*\n1. I was asked a question similar to [merge intervals](https://leetcode.com/problems/merge-intervals/). Given a list of meeting timings (start time, end time), given the slots for which a person would be occupied with meetings. I suggested two approaches, one was similar to sorting approach of merge intervals and the second was where we maintain an array of size 24*60 and mark the occupied time as 1. It was followed by several followups like pros and cons of using an array of size 24*60 for each day vs just storing the list of (start, end times) for each day, extending to multiple users etc.\n2. [First missing positive](https://leetcode.com/problems/first-missing-positive/solution/). I suggested sorting approach, followed by hash set, followed by using index as hash key. Interviewer was happy with the second approach itself and said it is fine\n\n*HR Round*\nSecond round was immediately followed by HR round. There were standard questions like why bloomberg, what are you looking for in a team, competing offers (I told about a competing offer that pays higher than bloomberg new grad range) etc.\n\n*Final Round*\nOverview of resume followed by a discussion on my most recent internship experience. The discussion on internship went on for next 30 minutes. Topics were ensuring scalability and concurrency of the project I worked on during the internship (kind of a system design).\n\n**Final Verdict**\nReceived a reject in about a week of the final interview. Overall interview experience was positve.\n

Status: MS CS\nExperience: ~3 years (Prior to Masters)\nDate: Aug - Oct 2020\n\nPhone Screen\nVertical Order Traversal Of Tree. I suggested the optimal approach