The company arrived on campus for a career fair.
At the fair, a simple array question was asked at the stall.
Subsequently, I received an invitation to a personal interview, also on campus.
During the interview, questions were asked about binary search trees, including verifying a binary search tree and the addition and deletion of elements to a BST. The interview lasted 50 minutes.
At a career fair:
Given an array of positive and negative numbers, what is the most efficient way to cluster all negative numbers on the left and all positive numbers on the right?
In a personal interview:
How do you verify if a given tree is a binary search tree?
The following metrics were computed from 5 interview experiences for the Bloomberg LP Software Engineer role in College Park, Maryland.
Bloomberg LP's interview process for their Software Engineer roles in College Park, Maryland is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Bloomberg LP's Software Engineer interview process in College Park, Maryland.