Interviewer called and ask me basic questions about my projects and resume.
Afterwards we dived into hackerrank in order to solve the problem.
He basically gave me the question where you have to implement a function x to the power of n.
I was 100% not expecting this problem at all.
I had to guess how pow is implement under the hood because I rarely use that function and I pretty much deduced that we can reduce the number of calls to the function if we do something like (x^2)^2 instead of x * x * x * x. He liked the approach we coded it out.

Basically be prepared for any question tagged bloomberg in leetcode. I was fortunate enough to have studied a lot so I had some intuition for the problem. Let me know if you have any questions