← Back to Directory

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

Jun 2026
Bloomberg coding round, pretty standard grid problem but the state tracking tripped me up more than I expected.
  • Given an m by n grid where 0 is open and 1 is a wall, find the minimum number of steps to travel from the top-left to the bottom-right corner. You can remove at most k walls along the path. Movement is 4-directional. Return -1 if no path exists.

“I knew BFS immediately but fumbled on the state representation for a bit.”

View Post

Bloomberg·Software Engineer·Hiring Manager Screen

Jun 2026
Bloomberg engineering manager behavioral round for a software engineer role. No technical questions at all, just a pretty thorough dig into my resume and career story, especially around any role transitions and what I carried over from past experience into how I work now.
  • Walk me through your career arc and how you got to where you are now.
  • Why did you make the transition between roles or functions earlier in your career?
  • What did you take away from your product management background, and how does it show up in your engineering work today?
  • How does your prior experience shape the way you collaborate across functions now?

“I had a rough draft of this in my head but it came out kind of scattered.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SE interview focused entirely on resume deep dives. They pick a project and just keep pulling on threads until you either have the numbers or you don't.
  • Walk me through one of your most substantial projects. Set up the context, explain what you personally owned, and describe the key technical decisions you made.
  • For each technical decision in your project, what alternatives did you consider and why did you reject them?
  • What was the measurable impact of your project? Things like latency improvements, cost savings, or revenue effects.
  • Looking back at the project, what would you do differently and what did you actually learn from it?
  • When you say you 'scaled' the system or made it 'reliable,' what specifically does that mean in terms of mechanisms and numbers?

“The part that tripped me up was the 'what you personally owned' distinction.”

View Post

Bloomberg·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Bloomberg system design follow-up, pretty deep into memory modeling territory for a next-token predictor. One question but it had a lot of moving parts and I don't think I covered all of them well.
  • Given a fixed memory budget, how many distinct words can a next-token predictor realistically store? Walk through the per-entry storage cost, how vocabulary size grows over time, and what strategies you'd use to keep memory bounded.

“This one tripped me up more than I expected.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview with a grid traversal problem. Pretty standard coding round but the follow-up on BFS specifically kept it from being totally routine.
  • Given a 2D grid of '1's (land) and '0's (water), count the number of islands. Follow-up: solve it using BFS and walk through how you'd handle edge cases.

“My first instinct was DFS and I coded that up fine, but then they asked me to redo it with BFS and I fumbled a bit with the queue initialization.”

View Post

Bloomberg·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Bloomberg SWE coding round, one meaty design-and-implement question that took up the whole session. More involved than a typical LeetCode problem since you had to think through data structure choices, edge cases, and write actual tests.
  • Build an in-memory LRU cache where each entry has a variable byte size. The cache supports get, set, delete, and resize operations. Capacity is a byte budget, not an item count. Evictions happen on insert and resize. A single entry larger than the capacity should be rejected. Aim for O(1) amortized on reads and writes, and write unit tests covering size-changing updates, eviction ordering, edge deletions, and capacity reduction.

“This one had a lot of moving parts and I underestimated the resize case early on.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg asked me a follow-up on LC 34 that I wasn't ready for. The twist was supporting arbitrary insertions mid-array while still being able to query first and last positions in log time. Took me a minute to stop thinking in sorted-array terms.
  • You have a dynamic sequence where elements can be inserted at any position. After each insertion, you need to efficiently find the first and last occurrence of a target value. What data structure would you use, and how does it compare to a sorted array?

“I started with sorted array out of habit and the interviewer just kind of waited.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview with a sequence generation problem that looks deceptively simple until you realize the naive approach is going to time out. The core challenge is figuring out how to track previously seen values without rescanning the whole sequence each step.
  • Given an integer n >= 1, compute the (n-1)th element of a sequence where a[0] = 0, and each subsequent element is either 0 (if the previous value hasn't appeared before) or the distance back to its most recent prior occurrence. Design an efficient algorithm to do this.

“I stared at the example for longer than I'd like to admit.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview with a graph traversal question that's basically a reskin of a well-known LeetCode problem. Pretty standard technical screen, nothing too surprising.
  • You have a grid of balloons. Each minute, a popped balloon causes its neighbors to pop too. Given an initial state, return the total minutes until all balloons are popped, or -1 if it's not possible.

“It's LeetCode 994 with a coat of paint, which I actually recognized pretty quickly.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg coding screen for a software engineer role, one question, grid-based BFS problem that's basically a reskin of a well-known leetcode problem. Pretty straightforward if you've seen it before.
  • Given a 2D grid where cells can be empty, inflated, or popped balloons, a popped balloon causes adjacent inflated balloons to also pop. Determine whether all inflated balloons can eventually be popped.

“Recognized it pretty fast as the rotting oranges problem with a costume on.”

View Post