I spoke with Bloomberg, and they scheduled an interview a couple of days later. My first round went well. At the end of the interview, they told me they'd like to schedule a second interview for the following day. The second interview didn't go so well, and I received a rejection a couple of days later.

Both interviews were two-on-one technical interviews. In the first interview, they asked two questions: one of easy difficulty relating to strings, and another of medium difficulty relating to hash tables.

In the second round, they asked two questions: one of hard difficulty pertaining to topological sorting, and another of medium difficulty pertaining to BFS with a counter on a binary tree.

First Interview: String Compression on LeetCode.

The second question was sort of a design question where you were asked to implement three functions to get the average time between two stations in a subway system.