Round 1 :
reverse integer (careful about integer overflow)
Give a string like "BBBCADDDD", return "DDDDBBBCA" with characters sorted by frequency.
A customer clicks on bloomberg terminal and not happy with the response time. Given that all servers connect to one database for extracting information, what can you do to optimize loading performance ?

Round 2 :
Find kth node to the end of a linked-list
Given M arrays with N unsorted integers , return the intersection of all arrays.
Follow-up : optimize time complexity first, then do it in-place.
Implement Java ArrayList class with insert , remove, add, size operations.

Round 3:
Go over your project, asked very specific questions.
Java garbage collection, why not use reference counting on objects so that we don't have to scan and mark unreachable objects ? (circular reference)

Question

Round 1 : 
reverse integer (careful about integer overflow)
Give a string like "BBBCADDDD", return "DDDDBBBCA" with characters sorted by frequency. 
A customer clicks on bloomberg terminal and not happy with the response time. Given that all servers connect to one database for extracting information, what can you do to optimize loading performance ?

Round 2 :
Find kth node to the end of a linked-list 
Given M arrays with N unsorted integers , return the intersection of all arrays.
Follow-up : optimize time complexity first, then do it in-place.
Implement Java ArrayList class with insert , remove, add, size operations.

Round 3:
Go over your project, asked very specific questions.
Java garbage collection, why not use reference counting on objects so that we don't have to scan and mark unreachable objects ? (circular reference)

Bloomberg

Bloomberg Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches