← Back to Directory

Bloomberg interview notes, page 1 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 coding screen for a software engineer role. One algorithmic question, sliding window stuff, nothing too exotic but you really need to nail the complexity justification or they'll keep pushing.
  • Given a string, find the length of the longest substring that contains no repeated characters.

“I knew this one but still fumbled the explanation a bit.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE coding round, one question on string manipulation with parentheses. Pretty standard algorithmic problem but the stack angle is easy to miss if you haven't seen it before.
  • Given a string containing '(', ')', and lowercase letters, remove the minimum number of parentheses to make the string valid. Return any valid result.

“My first instinct was to just scan left to right and count unmatched parens, which kind of works but gets messy fast.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview with a grid-based word search problem. Pretty standard backtracking territory but still worth thinking through carefully before you open your mouth.
  • Given an m x n grid of characters and a target word, determine whether the word can be formed by following a path of horizontally or vertically adjacent cells, where no cell is visited more than once.

“Went with DFS plus backtracking which is the right call.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview with a linked list problem that sounds manageable until you actually sit down with it. The recursive structure tripped me up more than I expected.
  • Given a doubly linked list where some nodes have a child pointer pointing to another doubly linked list (which can itself have children), flatten the entire structure into a single-level doubly linked list. The traversal order should be depth-first, and all child pointers should be null after flattening.

“I got the basic idea pretty fast but then fumbled on the pointer updates.”

View Post

Bloomberg·Software Engineer·Onsite - System Design / Architecture

Apr 2026
Bloomberg system design round for a software engineer role, focused entirely on designing an object-oriented Wordle clone. Pretty deep dive for a single question, they wanted class hierarchies, edge case handling, and extensibility all in one go.
  • Design an object-oriented Wordle game. Include classes for the word source, game state, guess validation, and feedback computation. Handle duplicate letters correctly and discuss how you'd extend the design for different word lengths, daily word mode, multiplayer, and hard mode.

“This took me longer to get into than I expected.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview with a classic grid traversal problem. Nothing too surprising but the constraints trip you up if you're not careful.
  • Given a 2D grid of characters and a target word, determine whether the word can be found in the grid by moving through horizontally or vertically adjacent cells, without reusing any cell.

“Classic backtracking problem.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview with a sequence generation problem that looked deceptively simple until I actually had to think about the data structure behind it. One question, pretty focused on implementation and the reasoning around index tracking.
  • Given a positive integer n, implement a sequence where each element is either 0 (if the previous value hasn't been seen before) or the gap between the last two occurrences of that value. Return the element at index n-1. The sequence starts: 0, 0, 1, 0, 2, 0, 2, 2, 1, 6, 0, 5... How do you efficiently track the last-seen index of each value?

“I knew the sequence pattern pretty quickly, the logic clicked after tracing through a few values by hand.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE interview focused on a single meaty data structure design problem. The whole session was basically one question with a lot of follow-up drilling, which I wasn't expecting.
  • Design a data structure that supports insert, delete, and top-K most frequent elements, where K is fixed at construction time. Defend your design choices and discuss complexity for each operation.
  • Why is calling Counter().most_common(K) on every query not good enough? Justify your data structure choice over that approach.
  • What are the edge cases for this data structure, specifically around deleting an element down to zero occurrences, inserting a brand new element, and handling frequency ties in the top-K result?
  • How would your design change if there are hundreds of millions of distinct elements? Walk through an approximate approach.

“I went straight for HashMap plus a min-heap of size K and felt pretty good about it until they pushed back on delete.”

View Post

Bloomberg·Software Engineer·Recruiter / HR Screen

Apr 2026
Standard behavioral round for a software engineer role at Bloomberg. Nothing too surprising, just the usual HR questions you'd expect before getting to the technical stuff.
  • Tell me about yourself.
  • Why do you want to work at Bloomberg specifically?
  • What motivates you in your work?
  • What are your strengths and weaknesses?
  • Tell me about a time you had a conflict with a teammate or colleague. How did you handle it?
  • Describe a situation where you were under significant pressure. How did you manage it?
  • Tell me about a time you failed. What did you learn from it?
  • What's your biggest professional accomplishment so far?
  • What are your compensation expectations?

“I always fumble this one a bit.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Apr 2026
Bloomberg SWE coding round, one problem the whole time. The question was about building a randomized set with O(1) operations, which sounds manageable until you actually think about getRandom without a list.
  • Design and implement a RandomizedSet class that supports insert, remove, and getRandom, where each operation must run in O(1) average time.

“The insert and remove with O(1) are fine with a hashmap, but getRandom is where it gets tricky.”

View Post