Phone Screen1:
Q1->[Stock Execure MinOrder](https://leetcode.com/discuss/interview-question/506270/Bloomberg-or-Phone-Screen-(2020)-or-Min-order)
Q2-> Return First non repeating char in a string.
eg: Bloomberg -> 1st non repeating char is l


Phone Screen 2:
1. [Flatten Linked list](https://leetcode.com/discuss/interview-question/506326/bloomberg-phone-flatten-multilevel-linked-list)
2. Given a tree of server nodes find all the uniqe path from one server node to another node.(Simple BFS)

Virtual Onsite:
1. https://leetcode.com/discuss/interview-question/682583/bloomberg-phone-order-list-in-welsh-alphabetical-order

2.Summary: Given list of events of a given day in a calendar, write an algorithm to return a list of busy view time slots. Busy view is created by the consolidating adjacent and overlapping event time slots without showing details of individual events.

Details: Each event in calendar has a start time, end time & some title. Events can start at any minute (granularity at the minute only, no seconds).

Input: list of following events
(100,300, "Some Event")  // 1:00 am to 3:00 am
(115,145, "Some Event")
(145,215, "Some Event")
(200,400, "Some Event")
(215,230, "Some Event")
(215,415, "Some Event")
(600,700, "Some Event")
(500,600, "Some Event")
Output: Based on above events, my busy view should show like this:
(100,415) // Busy from 1am to 4:15 am
(500,700) // Busy from 5am to 7:00 am