Bloomberg Software Engineer interview questions

86 Software Engineers have shared notes from their Bloomberg interviews, with the questions they were asked in each round. That is 99% of the 87 Bloomberg interview notes on Screna AI.

86 Software Engineer interview notes

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg coding round, one question, parentheses cleanup problem. Stack-based solution is the move but I spent too long second-guessing myself on edge cases.
  • Given a string containing '(', ')', and lowercase letters, remove the minimum number of parentheses to make the string valid, and return any valid result.

“Knew a stack was the right tool pretty quickly but fumbled the reconstruction part.”

View Post

Bloomberg·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Bloomberg system design round for a software engineering role. The whole thing was centered on one meaty problem about stock ticker ingestion and top-K retrieval, and it went deeper than I expected on the concurrency and throughput angles.
  • Design and implement a service that consumes stock ticker symbols from a high-frequency upstream API and exposes the current top-K most frequently seen tickers in real time.
  • How would you handle the ingestion side given the upstream API fires at a very high call rate? Walk through batching, async queuing, and backpressure strategies.
  • How do you manage concurrency when multiple threads or processes are both ingesting tickers and reading the top-K results simultaneously?

“I jumped straight to a hashmap plus min-heap and felt pretty good about it until they pushed on update frequency.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview that was pretty much one meaty algorithmic problem the whole time. The round-robin scheduling problem sounds deceptively clean until you actually have to enumerate all valid schedules.
  • Given n football teams, generate a complete round-robin tournament schedule where every team plays every other team exactly once. For even n there are n-1 rounds with n/2 simultaneous matches per round; for odd n there are n rounds with one team getting a bye each round. Output all valid schedules, and for n=4 enumerate all of them.

“I started with the even case because the structure felt cleaner, built a backtracking solution tracking which pairs had already played, and got something working.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview with a linked list problem that looked straightforward on paper but had enough edge cases to keep me second-guessing myself the whole time.
  • Given a doubly linked list where some nodes have a child pointer referencing another doubly linked list (which can itself have children), flatten the entire structure into a single-level doubly linked list. The flattened list should visit children depth-first before continuing with the rest of the original list, and all child pointers must be null afterward.

“I got the depth-first traversal part pretty quickly but then fumbled on the pointer rewiring.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg coding interview, standard algorithmic problem about scheduling. Nothing too wild but the constraint about minimizing rooms made me think harder than I expected.
  • Given a list of meeting time intervals, find the minimum number of conference rooms needed so no two meetings overlap in the same room.

“My first instinct was to sort and brute force it, which works but not efficiently.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview that came down to a single coding problem, and I got tripped up on a follow-up I'd never seen before. Rejection came the next day.
  • Solve the longest substring without repeating characters problem, then explain an approach that avoids using a sliding window and never moves the left pointer.

“I knew the sliding window solution cold and walked through it fine, complexity included.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg Data Engineer interview with a finance-flavored analytical question that threw me a bit. The follow-up about private companies is where it got interesting.
  • When analyzing a financial report for a company in an unfamiliar industry, which single metric would you prioritize and why? Follow-up: if the company is small and private rather than public, does your answer change, and what metric matters most then?

“The public company part I handled okay.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg coding round, one problem the whole time. It was a Wordle mechanics question which sounds fun until you actually have to handle the duplicate letter edge cases correctly under pressure.
  • Implement Wordle-style feedback: given a guess and a target string of equal length, return a per-character result indicating exact match, present but wrong position, or not present. Duplicate letters must be handled correctly so a letter isn't marked 'present' more times than it actually appears in the target once exact matches are removed.

“The basic loop is easy enough but I fumbled the duplicate handling.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE interview had at least one coding round focused on classic string problems. Nothing too wild but the expected level of precision on complexity analysis was real.
  • Given a string, find the length of the longest substring that contains no repeating characters.

“Knew sliding window was the move pretty quickly, but getting the pointer logic exactly right took me a minute.”

View Post

Bloomberg·Software Engineer·Technical Phone Screen

Jun 2026
Bloomberg SWE coding round, one problem the whole time. The question was harder than it looked and I fumbled around longer than I should have before landing on a real approach.
  • Given a string containing parentheses and other characters, remove the minimum number of invalid parentheses to make it valid. Return all possible results with no duplicates.

“Knew BFS was the safe play since it naturally finds the minimum removals level by level, but I kept second-guessing myself and started rambling about DFS first without a clear pruning strategy.”

View Post