Hi guys,
Here is the summary of my Bloomberg Onsite Experience for position in NYC.

Round 1:

• Started with brief discussion on past projects.
• Got asked about the definition of Binary Search Tree followed by coding question on kthLargest Element in a Binary Search Tree.
  Did an iterative reverse inorder traversal while keeping track of the k. Got asked follow up questions to actually think about all the edge cases. Could come up with couple of them.
• Given an array find indices of k elements which will form minimum sum out of the array. Similiar to k smallest elements in an array.
  Discussed briefly couple of solutions and implemented the max_heap solution and discussed quick select as well.

Round 2:

• Started with specific discussion on a project that I had worked on.
• Implement a News Feed Api:
  Implement two public methods of news feed.
  publish_story(title, tag) - Publishes a story given the title and a tag is associated with the title.
  get_news_feed(tags) - given a tag list fetch all the titles based on the chronological order of the news articles.
  Gave a solution using HashMap of tag -> LinkedList(titles). And add the latest one in front of the LinkedList.
  get_news_feed then comes down to merging k sorted lists. Brief discussion on alternatives and complexities.
• Given a skyline of buildings in form of their elevation in an array. Identify the difference between the current building and the next greater building in the array(Next greater element on the right).
  Gave a Stack based solution and went briefly through it.
  Followed by talks on what kind of projects I would love to work at Bloomberg. And couple of Data Structure Questions.

After this was told I am done for the day. PS: The sandwich at lunch is as good as famed to be :)