J'ai passé un entretien chez Bloomberg (Charlotte, NC) en janv. 2013
Entretien
Initially they had an on-campus interview with a couple of technical questions about trees and hashing. I thought I had bombed but I think they saw that I was constantly thinking so I got a second interview. This one was all technical with whiteboard coding and a week after I got an offer.
Questions d'entretien [1]
Question 1
Given two trees over the same set of nodes, what is the longest path they have in common?