I applied directly online. They got back to me within a few days and set up a first-round technical screener interview. The HR process was smooth. I did not make it to the second round.

The screener interview:

• About one hour: approximately 15 minutes discussing my resume, 40 minutes coding, and 5 minutes for my questions for them.
• The interviewer was very nice and supportive, seeming to have had good training in interviewing.
• The technical portion consisted, for me, of two questions (see below in the questions section).
• The questions were fielded in a pair-programming tool from HackerRank, but the interviewer stressed that I didn’t have to write compilable code; pseudocode was fine. (That said, the fact I was in a kind of IDE prompted my fingers to type semi-real code, which distracted me from the logic. Whiteboarding, or using just a shared text document, might have been easier.)
• I wrote out workable solutions to both, spoke about trade-offs of various approaches, and don’t think I sounded like an idiot. I did not “finish” coding either but had code or pseudocode/logic down, so implementations were all there in one form or another. I thought I did okay, though I knew I could have been faster.

Post-interview:

• No feedback on why I didn’t get to the second round was given. It might have been my speed, or perhaps a mismatch in background—the interviewer noted Bloomberg is primarily a C++ and Python shop on the back-end, and my background is with other languages. (Might have been other things too that I’m blind to, of course!)
• Overall, the process was smooth and quick. If nothing else, it helped me get some interview practice. It could be worse!

Given an array, return the count of duplicate integers in it.

Implement a stack (using anything but an actual pre-rolled Stack class, e.g., Java’s Stack) that can return its min value in constant time (with a time complexity O(1), I think it said).