Bloomberg | Onsite | London | Non Leetcode Question
Anonymous User
2379

I had my onsite a few days ago. They started off with introductions which took 20 mins and then I gave my introduction. Opened link to hackerrank and saw a non leetcode question.

You have flights e.g.

A->B
B->C,D
C-E
D-E

Had to implement 2 methods. One was to add a new start and end location. The other was to print all locations from a starting point to a destination e.g. print all possible travel methods from A to E.

Follow up: How to make your solution more efficient if you knew that an airport was not going to get you to your desination

Rejection 2 days later :(

Comments (7)