← Back to Directory

Bloomberg interview notes, page 5 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

May 2026
Bloomberg data engineering interview, technical phone screen focused on a meaty coding prompt where they hand you an existing codebase and ask you to extend it without touching the abstractions. The question was dense and I spent the first few minutes just reading the scaffold before I even knew what they were asking.
  • You're given an existing Python codebase with an abstract base class and a factory/registry pattern already in place. Without modifying the abstractions, implement a concrete CSV-to-JSON processor that reads CSVs in chunks, normalizes each row into a JSON object, writes line-delimited JSON to an output file, handles bad rows with a retry and logging policy, and registers itself so the CLI can invoke it by name.

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

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a system design coding question focused on building a to-do list class from scratch. Pretty classic OOP design problem but with enough depth in the follow-ups to keep you on your toes.
  • Design a to-do list class with add, delete, get by id, and get all operations. An external helper tells you if an entry is completed. Pick your data structures, define the entry schema, and talk through thread safety and edge cases.

“I went straight for a hashmap keyed by id, which was the right call for O(1) lookups on get and delete.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a two-part coding problem. The first part was a classic interval merging question, and then they added a twist with busy/available flags that made things considerably more interesting.
  • Given a list of meeting intervals as start/end pairs, merge all overlapping intervals and return the resulting list.
  • Follow-up: each interval now has a boolean flag indicating whether it's busy or available. Output only the busy portions of the timeline, given that available intervals override busy ones wherever they overlap.

“Pretty standard stuff if you've done any interval problems before.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview that went deep on trie design, not just implementation but the whole design space around it. More discussion-heavy than I expected for a coding round.
  • Design and implement a trie (prefix tree) that supports insertion, full-key lookup, prefix existence checks, and enumeration of all keys sharing a given prefix.
  • How do the space and time trade-offs of a trie compare to using a hash map for the same key storage and lookup use case?
  • What compaction strategies exist for tries, and how would you approach implementing something like a radix tree or Patricia tree?

“I got the basic structure down pretty quickly, nodes with a map of character to child node, a flag for end-of-word.”

View Post

Bloomberg·Software Engineer·Onsite - System Design / Architecture

May 2026
Bloomberg SWE interview, system design round focused on building an in-memory trade subscription engine in C++. The problem looked deceptively like a coding question but quickly turned into a full design discussion about data structures, matching logic, and concurrency.
  • Design and implement the internals of an in-memory trade subscription processor in C++. Given a simplified interface with subscribe, onNewTread, and unSubscribe methods, what private data structures would you use, and how would each method work conceptually?
  • How would you handle thread safety in this system, given that one thread is continuously calling onNewTread while another may be adding or removing subscriptions concurrently?
  • What is the time and space complexity of your design for subscribe, onNewTread, and unSubscribe?

“The interface looked clean so I jumped straight to a flat vector of subscriptions and immediately realized that's a disaster at 10^5 subs with tens of thousands of trades per second.”

View Post

Bloomberg·Product Manager·Onsite - Product Sense / Strategy

May 2026
Bloomberg PM interview with a platform migration scenario. The question was meaty enough that I kept second-guessing whether they wanted a strategy answer or a technical trade-off breakdown. Came away feeling like I probably over-indexed on the stakeholder side and under-delivered on the actual decision framework.
  • You're the PM for a software product going through a system migration. How do you keep the existing stack supported during the transition, and what factors drive your decision on whether and when to add support for a new operating system?

“I started with clarifying questions about user segments and SLA commitments, which felt right, but then I kind of rambled when it came to the actual decision criteria for new OS support.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE coding round, just the one question about string frequency cleanup. Pretty straightforward premise but the edge cases are where it gets you.
  • Given a string, find the minimum number of character deletions required so that every character in the string has a unique frequency.

“The naive approach feels obvious until you start thinking about what happens when multiple characters collide on the same count.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg coding round, one problem the whole session. Grid traversal with fuel constraints. Not the hardest thing I've done but I fumbled the state tracking part longer than I'd like to admit.
  • You're given a 2D grid with passable cells, obstacles, gas stations, a start, and an end. You begin with a fixed amount of fuel and spend 1 unit per move. Gas stations refill you to full. Can you reach the end?

“My first instinct was plain BFS and I coded like half of it before realizing revisiting cells is actually valid here because your fuel level changes after hitting a gas station.”

View Post

Bloomberg·Software Engineer·Onsite - Coding / Algorithms

May 2026
Bloomberg coding round, one algorithmic problem the whole time. The question was more geometry-flavored than I expected from a finance company interview, and the optimal path required knowing a specific trick I'd never actually used before.
  • You have a 2D grid where some cells contain houses and others are empty. You need to pick one cell to place a turret that protects all houses within Manhattan distance k. Return the maximum number of houses you can protect with a single turret placement.

“I started with the brute force and talked through it fine: iterate every cell, count houses within distance k, track the max.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

May 2026
Bloomberg SWE interview with a sorting/counting problem that looks easy until you actually sit down and think about the edge cases. Pretty standard technical screen vibe.
  • Given an array of ages, count the total number of directed friend requests sent, where person A sends a request to person B only if B is greater than half of A plus 7, B is at most A, and A and B are different people.

“My first instinct was brute force O(n^2) and I coded it up fine, but then they asked about scale.”

View Post