← Back to Directory

Bloomberg interview notes, page 3 of 14

Large Enterprises

Most of these Bloomberg write-ups come from Software Engineers (130), then Product Managers (2) and Data Analysts (1). The most reported rounds are the technical phone screen (100), the behavioral / leadership round (8), the onsite coding round (8) and the system design round (8).

133 interview notes · updated Oct 2026

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg Data Engineer interview with a single SQL question that looked manageable until I remembered I couldn't just reach for BigQuery functions. The whole thing was a parsing exercise dressed up as a filtering and aggregation problem, and the cross-dialect comparison at the end was a nice twist I wasn't expecting.
  • You have a PostgreSQL table with a raw text column storing pipe-delimited key=value pairs. Write a single SQL query that parses the raw column into structured fields (user, country, timestamp), filters for US rows in August 2025, and returns the daily count of distinct users ordered by day. Also name the BigQuery functions you'd normally reach for and their PostgreSQL equivalents.

“My brain went straight to BigQuery's REGEXP_EXTRACT and PARSE_TIMESTAMP before I even finished reading the question.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview with a classic string parsing problem. Nothing flashy, but the edge cases will trip you up if you're not careful.
  • Implement the atoi function: convert a string to a 32-bit signed integer, handling leading whitespace, optional sign characters, non-digit terminators, and clamping to the 32-bit signed integer range.

“I thought I had this nailed in the first two minutes and then spent the rest of the time patching edge cases.”

View Post

Bloomberg·Software Engineer·Recruiter / HR Screen

May 2026
Recruiter screen for a data management role at Bloomberg. Pretty standard call, just them sizing up whether your background actually matches what they're looking for.
  • How do you understand the requirements of this role, and how does your background align with them?

“Classic opener but I fumbled it a bit because I hadn't really mapped my experience to the specific role language they used in the posting.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a classic scheduling problem. Nothing too surprising but it requires you to actually think through the edge cases carefully.
  • Given an array of meeting time intervals, find the minimum number of conference rooms needed so no two overlapping meetings share a room.

“Classic heap problem but I fumbled explaining why a min-heap works here before just coding it.”

View Post

Bloomberg·Software Engineer·Onsite - Coding / Algorithms

May 2026
Bloomberg SWE coding round, two algorithm problems back to back. Nothing too surprising if you've done leetcode but the second one had a follow-up about space optimization that tripped me up a bit.
  • Given a 2D grid of characters and a target word, determine whether the word can be formed by moving through adjacent (horizontally or vertically neighboring) cells without reusing any cell.
  • Given an array of bar heights, calculate the total units of water trapped between the bars after rainfall. An efficient solution in both time and space is expected.

“Classic backtracking problem.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE coding round with a two-part problem that combined graph-based ordering with a substring frequency question. The second part got a bit chaotic mid-interview when the scope changed, which was a whole thing.
  • Given a sorted dictionary from an alien language, determine the ordering of its characters.
  • Given a string and integer k, find the length of the longest substring where every character appears at least k times.

“Classic topological sort problem.”

View Post

Bloomberg·Software Engineer·Onsite - System Design / Architecture

May 2026
Bloomberg system design round focused entirely on Kafka internals and delivery semantics. Pretty deep for a single question session, they clearly wanted more than surface-level answers.
  • Walk me through how Kafka partitions, replication, and consumer groups work, and explain how each of those concepts affects message ordering, system scalability, and fault tolerance.
  • Compare at-most-once, at-least-once, and exactly-once delivery guarantees in a messaging system, and describe how you'd build an idempotent, exactly-once processing pipeline end to end.

“I started with partitions and got through the basics fine, but when they pushed on ordering guarantees across partitions I fumbled a bit.”

View Post

Bloomberg·Software Engineer·Onsite - Coding / Algorithms

May 2026
Bloomberg SWE coding round, two problems back to back. Nothing too crazy but the second one was sneakier than it looked on the surface.
  • Given an array of distinct integers, return all possible subsets (the power set).
  • Given a string that may contain non-parenthesis characters mixed in, determine whether the parentheses in the string form a valid sequence.

“Pretty classic backtracking problem.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a meaty data structures design question. One round, pretty focused, no fluff.
  • Design a data structure supporting insert, remove, and topK operations on a multiset of integers, where topK returns the k most frequently occurring values. Discuss complexity, design choices, and edge cases.

“This one took me a minute to even parse what they wanted.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a binary search problem that sounds straightforward until the follow-up hits you. The core question was clean but the floating-point extension added a layer I wasn't fully prepared for.
  • You have N cables with integer lengths and a target K. Find the maximum integer length L such that cutting all cables into pieces of length L produces at least K pieces total. Return 0 if it's not possible. Walk through a binary search approach and analyze the time complexity.
  • Follow-up: how would you modify your solution to support non-integer cable lengths, with a precision requirement of 1e-3?

“The binary search framing clicked pretty fast for me.”

View Post