I applied online. I interviewed at Bloomberg (Frankfurt am Main) in Nov 2020
Interview
I connected to hackerRank and the interviewer called me on my cellphone.
He was very nice and would hint when I was going in a good direction. He always asked what time and space complexity my solution had.
Interview questions [1]
Question 1
Return a String with the characters present in the first word but not in the second word.
"ab", "ab" -> ""
"abc", "ca" -> "b"
"a", "z" -> "a"
They were looking for O(n+m).
I applied online. The process took 4 weeks. I interviewed at Bloomberg in Nov 2021
Interview
It started with a few behavioral questions then went into coding challenge. The interviewer was very kind, laidback, and helpful. It was clear she wanted me to know more about algorithms than I did.
Interview questions [1]
Question 1
Find length of longest string of unique characters in a string