Candidates describe a Bloomberg Data Engineer process with recruiter and manager conversations, algorithmic coding, a system design or case study round, and a final manager chat. Reports here ended in rejection or no reply yet.
$175K
Avg. Base Comp
$210K
Avg. Total Comp
4 rounds
Typical Rounds
Not reported
Process Length
Bloomberg Data Engineer candidates describe a process that moves from recruiter and manager conversations into real technical pressure, and the framing does not always match what happens in the room. One candidate was told to expect no LeetCode, then got a 50-minute problem combining a Story and StoryManager class, hashmap storage and a full binary search with lower and upper bounds for time-range queries. Another reported a string-parsing problem and an in-memory stock ticker with O(1) updates before a system design round.
Design questions are where two reports get demanding. One candidate was asked to build a news-alerting service with sub-200ms latency and had caching and backpressure challenged. Another called a case study based on a recent real project the hardest round, because it asked for architecture, trade-offs and scalability beyond code.
Experience-based questions matter too. A candidate for a Commodities Data quality role was asked about conflicting vendor values, whether a control should block a pipeline or only warn, migration validation, KPIs like MTTD and MTTR, and production incidents. Come with metrics and a clear account of what you personally designed.
Four of the five reports ended in rejection, and one candidate was still waiting for a reply. Experiences of the process differed: one candidate said the team followed up when promised, while another heard nothing for months after consecutive onsite days. Ask your recruiter about timing and a follow-up contact before you commit time off.
Synthesized from 8 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.
Four rounds back-to-back. I breezed through the string parsing problem and felt unstoppable. Then the system design round hit: they grilled me on real-time latency and cache invalidation. My mind blanked, my hands got sweaty, but I talked through my panic and barely scraped by. Total whirlwind.
Questions asked: They threw LeetCode 1396 at me first, then hit me with "Design an in-memory stock ticker with O(1) updates." The brutal part was the system design: build a news alerting service with sub-200ms latency. They tore apart my caching and pushed hard on handling backpressure. Highly practical!
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 | |
| News Alert Latency | |
| Target Value Search | |
| Longest Increasing Subsequence | |
| 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 | |
| Shortest Path Algorithms | |
| Summing Numeric Strings | |
| 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.
Candidates describe an early recruiter or HR conversation about their background, the team and what they are looking for. One recruiter set expectations for the technical rounds, though that candidate later found the coding round harder than described. Treat the reassurance cautiously and prepare for coding.
Some candidates describe a call where team leads or managers went through their CV and past projects. A Commodities Data quality candidate was asked about conflicting vendor values, migration validation, automation impact, KPIs and production incidents. Prepare concrete metrics and what you personally designed.
Reports include a Python algorithmic question, a string-parsing problem, an in-memory stock ticker with O(1) updates, and a 50-minute class design with hashmap storage and full binary search. One interviewer rejected a linear scan as brute force. Practice implementing lower and upper bound searches, not just describing them.
Two candidates describe a design-heavy round. One was asked for a news-alerting service with sub-200ms latency and was pushed on caching and backpressure. Another received a case study based on a real recent project and found its scope and depth hard. Prepare to discuss architecture, scalability and trade-offs.
One candidate had a relaxed final talk with a senior manager about data experience, interests and Bloomberg culture. Another was asked about external stakeholders during onsite rounds on consecutive days and found the final discussion with the head unfocused. Prepare a stakeholder example and ask about decision timing.
