I applied online. The process took 1 week. I interviewed at Bloomberg in Apr 2019
Interview
Applied online, received an automated notice to schedule some time. Get the call on the designated day. No human intervention at all... Not saying much about how they care about a possible candidate.
But that didn't ended up there. The interviewer was a Matrix character. And when I say Matrix, I say he was stuck in 1999. So after preparing linked list, binary searches, data structures, etc, Morpheus decided to ask about FizzBuzz!!! Wait a minute, what!?!?! How can I show my potential which such a silly problem?!? I thought that that may be a warm up question before a good one, but after the first quick implementation, he didn't stop there and it evolved into create a class with method fizzbuzz that was taking parameters, that was running independently, etc... I have done many interviews in my life, but that was the most boring one ever! It was like going over a boring shopping list... Note there are lots of posts out there making fun of how wrong was FizzBuzz used 20 years ago to hire software developers.
I guess that guy was looking for Neo, so I received a rejection letter.
I wanted to use Bloomberg just to test my interview skills. But now I see that I can not even use them.
Interview questions [1]
Question 1
1- FizzBuzz?!?!
2- Given a list of tasks with memory usage, cpu, and Bandwith, wow you would fit different processes on N machines
Apply through their links online. Then I was contacted in less than a week to select a phone screening interview. During the phone interview they asked me to choose one of my projects on my resume and explain why I chose it and what technologies I used and why... After that I was giving a programming problem to solve in any language. I am still waiting to hear back...
There were 3 panel interviews. Each interview had 2 interviewers. Two of these interviews were techincal and one was with HR. The technical questions asked were unique and challenging. I needed a hint and used it.
Interview questions [1]
Question 1
How Dijkstra's algo can be improved if graph is a grid