Bloomberg

Bloomberg Software Engineer Onsite Coding Questions

428+ questions from real Bloomberg Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

428
Questions
8
Topic Areas
10+
Sources

What does the Bloomberg Onsite Coding round test?

The Bloomberg onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Bloomberg Software Engineer Onsite Coding Questions

Bloomberg Senior Software Engineer Onsite Interview Experience 2025

Graph,Design,Bit Manipulation,Recursion,System Design 2025

**Round 1 (60 minutes)** **Problem:** Gas Station / Oasis / Car Path Problem. Find a path between two points. **Reference:** https://leetcode.com/discuss/post/1608777/bloomberg-phone-screen-find-path-

**Round 1** **Problem:** Implement a simplified `grep` tool to find lines in a file containing a specific substring, prioritizing flag extensibility. **Solution:** Clarify requirements and implement p

I recently went through the interview process for Bloomberg’s SWE internship position. I passed 5 rounds, including the final EM round. I believed I did quite well, and this was actually reflected in

Applied to Bloomberg SWE Intern NYC and got an interview within two days of applying. Went to an on campus event and grinded LeetCode for two weeks straight. I vibed well with the interviewer. I was c

Just did my first onsite today and got rejected. This is the question: https://leetcode.com/problems/remove-letter-to-equalize-frequency/description/ its not hard, but very very tricky with so many edge cases. i have never done this...

The question ask you to build an IP store. Support adding IP (prefix) searching for IP counting how many IPs. But I am so confused about the second part, they said you can only...

Assume you have a car park (parking lot), with n spaces arranged linearly (let\'s say 10 spaces initially): The spaces are all the same size and will fit all vehicles...

Just got around to writing about my experience at the virtual onsite interview. I was given the same question as listed here, but was asked to come up with an...

I took my virtual onsite interview round for internship in Bloomberg London.There were 2 engineers in the meeting. Question was basically valid parantheses question in leetcode which followed by some follow-ups...

Bloomberg Senior Software Engineer Interview Question: I got the job offer :) This is one of the coding question which I found a little bit challenging initially but solved it at...

Current employment status: Status: New grad Location: NC Date: December 22, 2022 Final round (1 hour): - Testing: The interviewer gave a code and asked me to write test cases for the same. ...

Coding: 1. Trapping rainwater 2. Given bank opening and closing time, and tradeorder time, return if it can be successfully processed. Input : Bank opening times : Bank 1 : (11:00-17:00), Bank...

Giving back to the community. 1. 1D Candy Crush 2. All paths from source to destination 3. Design underground system 4. Why Bloomberg All the questions are available on Leetcode (except last one of course)....

Imagine\xA0we\xA0have\xA0a\xA0network\xA0of\xA0nodes\xA0where\xA0new\xA0information\xA0can\xA0be\xA0passed\xA0from\xA0one\xA0node\xA0to\xA0another\xA0node\xA0anaglous\xA0to\xA0how\xA0new\xA0gossip\xA0spreads\xA0from\xA0one\xA0person\xA0to\xA0the\xA0next.\xA0In\xA0order\xA0for\xA0information\xA0to\xA0spread\xA0across\xA0the\xA0network,\xA0each\xA0node\xA0finds\xA0a\xA0node\xA0to\xA0pass\xA0down\xA0the\xA0latest\xA0info\xA0or\xA0gossip\xA0it\xA0knows\xA0and\xA0this\xA0process\xA0repeats\xA0til\xA0the\xA0information\xA0is\xA0consistent\xA0across\xA0all\xA0nodes.\xA0This\xA0gossiping\xA0communication\xA0is\xA0one\xA0way\xA0a\xA0distributed\xA0system\xA0can\xA0reach\xA0consensus\xA0on\xA0information\xA0the\xA0network\xA0holds\xA0without\xA0seeing\xA0all\xA0the\xA0data\xA0available\xA0from\xA0all\xA0the\xA0nodes. Let\'s\xA0say\xA0we\xA0have\xA0a\xA0list\xA0of\xA0nodes\xA0each\xA0holding\xA0a\xA0unique\xA0positive\xA0integer\xA0and\xA0we\'d\xA0like\xA0to\xA0use\xA0this\xA0method\xA0to\xA0reach\xA0a\xA0consensus\xA0on\xA0what\xA0the\xA0largest\xA0integer\xA0is.\xA0A\xA0node\xA0can\xA0look\xA0like\xA0the\xA0following, struct\xA0Node { \xA0\xA0int\xA0my_value; \xA0\xA0int\xA0largest_value_i_know; \xA0\xA0 \xA0\xA0Node(int\xA0value) \xA0\xA0{ \xA0\xA0\xA0\xA0my_value\xA0=\xA0value; \xA0\xA0\xA0\xA0largest_value_i_know\xA0=\xA0value;\xA0//self,\xA0that\'s\xA0the\xA0only\xA0thing\xA0\xA0it\xA0knows\xA0 \xA0\xA0}; }; We\xA0will\xA0use\xA0a\xA0vector\xA0of\xA0nodes\xA0to\xA0represent\xA0the\xA0network\xA0and\xA0the\xA0goal\xA0is\xA0to\xA0implement\xA0a\xA0function\xA0like\xA0this: void\xA0find_largest_value(vector<Node>&\xA0nodes)\xA0//prints\xA0out\xA0the\xA0consensus\xA0and\xA0number\xA0of\xA0rounds. Assumptions/ Hints by interviewer: You\'re\xA0given\xA0random\xA0neighbor\xA0assignments,\xA03\xA0neighbors\xA0per\xA0node. You\'re\xA0given\xA0the\xA0assumption\xA0that\xA0this\xA0graph\xA0is\xA0fully\xA0connected. No\xA0messages\xA0are\xA0lost. Note: 1.How will you represent a single node? //Define class and data structure and write methods. 2.How will you write data to ther nodes\'s buffer for propogation. //One...

I got this question during Bloomberg on-site interview this week. Even after solving 170 LeetCode problems, I\'ve never seen a question like this. I wasn\'t able to solve it and...

Role: Senior Front end Engineer You\'re provided code that determines the \'next state\' of the popular game of life question Your task is to build up the Front-end of the game in...

Recently, in an interview I reached till the onsite rounds. Did really well till the last round. In the very last round, I solved two BFS based questions and the...

I had an interview with Bloomberg a few months back where i was asked the following question. You are hosting a meeting in 2 locations. All Employess need to attend the...

Interview 1: Question 1: Similar to Underground system on leetcode // o 86th Street Station // | // | // o 59th Street Station // | // | // o-----------o Grand Central // Times Square | // | // o 14th...

Implement the following two functions such that they are optimal. void addStocksVolume(string stockSymbol, int volume) vector<string> topKstocks(int k) addStocksVolume receives a symbol (INTC, APPL, etc) plus a volume which you cumulate over time. topKstocks...

What to Expect in the Bloomberg Onsite Coding Round

The Bloomberg Software Engineer Onsite Coding round has a specific calibration purpose distinct from other rounds in the loop. Across 428+ verified reports on LeakCode for this exact round type, the consistent expectations: clear scoping of the problem before diving into a solution, explicit reasoning about complexity, structured handling of edge cases, and the ability to discuss trade-offs between two reasonable approaches.

Reports tagged with the Onsite Coding round at Bloomberg show recurring patterns in difficulty and topic distribution. The Onsite Coding round is typically 45-60 minutes; the interviewer is calibrated against a specific rubric. The discriminator between candidates who advance and candidates who do not is rarely the final correctness of the answer. It is the path: did you clarify, did you verbalize your approach, did you handle edge cases, and did you communicate throughout.

How To Prepare for This Specific Round

Filter the questions below to the most recent reports (past 6-12 months). Questions tagged for this exact round type from this exact company at this exact role level are the highest-signal data available. Older reports may reference questions that have since rotated out of the company's pool.

Practice 4-6 representative problems from this set under timed conditions. The goal is not memorization (companies rotate questions); the goal is to internalize the patterns the interviewer typically reaches for and the depth of follow-up to expect. Reports on LeakCode also tag the typical follow-up depth at this round type, which is the discriminating signal between hire and no-hire calibration.

Onsite Coding Round Timing and Format

The Onsite Coding round at Bloomberg typically runs 45-60 minutes. Use the first 2-3 minutes to clarify requirements; you should never start coding or designing without verifying the input/output format, constraints, and edge cases out loud. Use the next 5-7 minutes to verbalize your approach before writing any code. The middle 20-30 minutes are implementation. Reserve the final 10 minutes for testing with concrete examples and discussing optimization or trade-offs.

Time budget discipline is one of the most reliable senior-vs-junior discriminators in this round. Strong candidates verbalize where they are in their budget out loud ("I've used about 20 minutes, I have 15 minutes left for testing and one optimization"). This signals engineering maturity to the interviewer and creates positive feedback they can capture in writing.

Common Failure Modes in This Round

Reports tagged "no hire" at Bloomberg Software Engineer Onsite Coding commonly cite: coding silently without verbalizing approach, jumping to implementation before clarifying requirements, missing edge cases (empty input, single element, very large input), producing working code that the candidate cannot refactor when asked, and failing to test their solution with concrete examples before declaring done.

The single most predictive failure mode in 2025-2026 reports: not asking clarifying questions. Interviewers at all FAANG companies are explicitly trained to weight this dimension. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's notes.

See All 428 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access