Bloomberg Data Engineer candidates report coding that combines class design, hashmaps, binary search, and time-range search, alongside system-design discussion and stakeholder-focused onsite conversations.
$158K
Avg. Base Comp
$210K
Avg. Total Comp
4 rounds
Typical Rounds
2 months
Process Length
Bloomberg Data Engineer interviews in the available reports combine implementation detail with applied data-and-systems discussion. One candidate reported four back-to-back rounds, beginning with a string-parsing problem and moving into a stock-ticker design and a news-alerting service. That account specifically mentions real-time latency, cache invalidation, backpressure, and a sub-200ms target, so be ready to explain design choices and trade-offs instead of only naming familiar components.
A separate candidate described a 50-minute coding session framed as practical data-structure work. The task involved designing Story and StoryManager classes, using hashmap-backed storage, and searching timestamped stories within an interval. The interviewer expected working lower- and upper-bound binary search rather than a linear scan. Practice implementing those bounds cleanly, with type-aware class design, and be prepared to explain the time and space cost of the approach.
Another report describes multiple onsite conversations over consecutive days, including a final discussion with a head. It calls out an external-stakeholder question, making a concrete example of communication, expectation-setting, and collaboration worth preparing. Evidence is limited and the reports do not establish one universal sequence, but together they point to coding fluency, systems reasoning, and clear discussion of real work.
Synthesized from 5 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Bloomberg Lp process.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Bloomberg Lp
Write a query to return whether each user's subscription date range overlaps with any other completed subscription
| Question | |
|---|---|
| Merge Sorted Lists | |
| Google Maps Improvement | |
| Most Repetition | |
| Hurdles In Data Projects | |
| Target Value Search | |
| Longest Increasing Subsequence | |
| News Alert Latency | |
| Binary Tree Validation | |
| Moving Window | |
| Median O(1) | |
| Inherited Model Evaluation | |
| Addressing Data Quality Issues | |
| 5th Largest Number | |
| Messenger Service Design | |
| Filling Supermarket Bag | |
| Blob Indexing | |
| Impossibly Iterative Fibonacci | |
| Minimum Days for Scheduling All Meetings | |
| Summing Numeric Strings | |
| Shortest Path Algorithms | |
| Check Matching Parentheses | |
| Client Solution Pushback | |
| Pathfinder in Maze | |
| Why Do You Want to Work With Us | |
| Your Strengths and Weaknesses | |
| LRU Cache 1 | |
| Minimum Parking Spots | |
| Analyzing Multiple Data Sources | |
| Prime to N |
Synthesized from candidate reports. Individual experiences may vary.
One candidate reported a 50-minute coding round involving Story and StoryManager classes, hashmap-backed storage, and searching timestamped stories in an interval. They were expected to implement lower- and upper-bound binary search rather than rely on a linear scan.
One candidate reported design questions about an in-memory stock ticker and a news-alerting service with a sub-200ms latency target. Their account says the discussion probed caching, cache invalidation, and backpressure.
A separate candidate reported multiple onsite interviews across consecutive days and a final discussion with a head. They recall being asked how they work with external stakeholders; candidates may want a specific example that covers communication and expectation management.
