Bloomberg LP · OA → Phone screen → Onsite
In processBloomberg New Grad SWE Interviews: 98 Experiences (Part 1 of 5)
Bloomberg new grad SWE interviews, March–May 2026: five-round loops, deep project talks, and coding on rolling windows, live stock prices and linked lists.
At a glance
- Process: a technical screen, then a superday with two more technical rounds and HR, then an engineering-manager round: five conversations in all (03, 08). Round one often opened with 10 to 20 minutes on a project (01, 02, 05).
- Asked recently: a resume or project deep dive in 7 of 8 reports. Named coding tasks: a five-minute active-user counter and Mutable Stock Price Top K (01), Count Ships and Decode String (05), Flatten a Multilevel Doubly Linked List (06), Two City Scheduling and station connectivity (07), a document-enrichment stream (04).
- Difficulty: follow-ups carried the weight. One screen kept adding duplicate users, out-of-order events and sharding (01); two candidates ran short on time or explanation and were rejected (05, 06).
- Practise first: Flatten a Multilevel Doubly Linked List, Decode String and Mutable Stock Price Top K.
Coverage: New grad SWE and SDE, 8 reports (01–08) with report dates from March to May 2026, screen through manager round. New York City and Pune are named; the rest did not give a location. The full series holds 98 reports from the United States, the United Kingdom, Germany, India and Japan.
In this series
- Part 1 (current): the series overview and timelines 01–08, March to May 2026: stream design, Count Ships and linked lists.
- Part 2: timelines 09–22, November 2025 to early 2026: New York and Frankfurt offers, Kafka in a manager round, Word Search and Wordle.
- Part 3: timelines 23–36, September to November 2025: Invalid Transactions, a fuel BFS follow-up and a top-news design round.
- Part 4: short reports 01–16 (November 2025 to August 2026) and timelines 37–50 (October 2024 to 2025): a streaming palindrome, Candy Crush and London offers.
- Part 5: short reports 17–48, October 2024 to November 2025: Number of Islands, multilevel-list flattening and Blackjack design.
Across the whole series, the full loop is usually five conversations: a screen, two more technical rounds (virtual, back to back, or on campus), HR and an engineering manager. Same-day continuation was a scheduling choice rather than a signal; some candidates did rounds two, three and HR in one afternoon, others over two weeks (Part 4). The first hour often split into about 10 minutes of resume, 40 of coding and 10 for questions (Part 5). Some rounds required running code in HackerRank, others only a dry run (Parts 2 and 4). Manager rounds ranged from a friendly project chat to Kafka design or a debugging exercise (Parts 2 and 4).
What came up
These eight 2026 candidates spent as much time defending past projects as writing code, and the coding leaned on state that changes over time: rolling windows, live prices and partial event streams.
| Topic | Reports | Last seen |
|---|---|---|
| Resume, project or experience deep dive | 7 of 8 | May 2026 |
| Streams, time windows and event state | 2 of 8 | May 2026 |
| Linked lists | 2 of 8 | Mar 2026 |
| Graphs and connectivity | 2 of 8 | Mar 2026 |
| Design or debugging round | 2 of 8 | Apr 2026 |
| Heaps and top-K | 1 of 8 | May 2026 |
| Trie | 1 of 8 | Apr 2026 |
| Stack or recursive parsing | 1 of 8 | Mar 2026 |
| Greedy assignment | 1 of 8 | Mar 2026 |
All dates are report months. A candidate can appear in more than one row.
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Active users in a five-minute window | 1 | May 2026 |
| Mutable Stock Price Top K | 1 | May 2026 |
| Document Enrichment Stream Aggregator | 1 | Mar 2026 |
| Count Ships in a Rectangle (LeetCode 1274) | 1 | Mar 2026 |
| Decode String (LeetCode 394) | 1 | Mar 2026 |
| Flatten a Multilevel Doubly Linked List (LeetCode 430) | 1 | Mar 2026 |
| Two City Scheduling, odd candidate count | 1 | Mar 2026 |
| Subway station connectivity queries | 1 | Mar 2026 |
Behavioral and resume
| Question | Reports | Last seen |
|---|---|---|
| Walk through a recent project: storage, QPS growth, production bugs, cache invalidation | 1 | May 2026 |
| Walk through your most recent internship | 1 | Mar 2026 |
8 detailed candidate timelines, loops, and screens
01: Active users, live stock prices and constant tradeoff questions
Report date: May 2026 · Role: New Grad SWE · Location: New York City · Status: Pending
- Project: a recent project, storage choices, QPS growth, production bugs and cache invalidation.
- Coding 1: a five-minute active-user counter. A queue plus per-user counts worked for ordered events. Follow-ups added duplicate users, out-of-order timestamps, sharding, frequent queries, cached results, cleanup and inclusive time boundaries.
- Coding 2: Mutable Stock Price Top K: keep updated prices and answer top-K queries. The candidate used a heap plus a map and lazily dropped stale heap entries. The interviewer cared about tradeoffs, edge cases and every state change, not tricks.
02: A Pune offer after hints, long waits and a team-match detour
Report date: April 2026 · Role: Entry-level / New Grad SWE · Location: Pune · Result: Offer
- A recruiter reached out in late November.
- Round 1: 20 minutes on a project, 40 on one tagged data-structures task.
- Round 2: a tagged problem and a trie challenge. The candidate could not finish the trie code but explained a hash-map alternative after hints, and still advanced.
- "System design" round: in practice, a specific data structure with one tricky edge case.
- Feedback took two weeks; the HR and manager invite took almost another month. After the manager talk, Bloomberg proposed an SRE match. The candidate said they wanted SWE, waited, followed up, and got the SWE offer.
03: A five-round loop that ended after the manager
Report date: April 9, 2026 · Role: New Grad SDE · Result: No offer
- A data-structures screen, then a superday elimination loop with two more technical rounds and HR, then an engineering-manager talk on experience and culture fit.
- The candidate felt every round went well; no coding prompts were shared.
04: Publishing documents from an enrichment stream
Report date: March 2026 · Role: New Grad SWE · Status: Not disclosed
- Documents pass through several enrichers; each event carries a document ID, an enricher ID and a payload. The Document Enrichment Stream Aggregator ignores unrelated enrichers and publishes a document once every required enricher has arrived.
- Reliability follow-up: publish whatever has arrived ten seconds after a document's first event, even if one enricher never answers. That needs per-document state, first-seen times, emit-once logic, and either lazy expiry checks or a periodic scan.
05: Count Ships, then Decode String against the clock
Report date: March 2026 · Role: New Grad SWE · Result: Rejected
- Bloomberg had no public new grad posting; a recruiter contacted the candidate directly. The round opened with their most recent internship.
- Problem 1: Count Ships in a Rectangle (LeetCode 1274), using a
hasShips(a, b)call. The candidate wrote the hard solution by hand. - Problem 2: Decode String (LeetCode 394). Time ran out before the code was complete, even with hints.
06: Working linked-list code after a shaky explanation
Report date: March 2026 · Role: New Grad SWE · Result: Rejected
- A short project chat, then Flatten a Multilevel Doubly Linked List. The hard part was reconnecting the tail of a flattened child list to the rest of the parent chain.
- The candidate struggled to explain those pointer links in the first dry run, became clearer once coding, finished a working recursive solution and answered the follow-ups. They were still rejected, and concluded they should have settled the reconnection rules before coding.
07: Two City Scheduling and an ambiguous subway graph
Report date: March 2026 · Role: New Grad SWE · Result: Rejected
- A deep resume discussion first.
- Problem 1: Two City Scheduling with an odd candidate count.
- Problem 2: given subway-station connections, answer whether two stations are connected. The report never said whether links were directed, how the graph was stored or whether queries had to be constant time, so replies suggested both Union-Find and strongly connected components.
- Both problems required the candidate to write their own tests.
08: Three technical rounds, HR, then a debugging-style final
Report date: March 24, 2026 · Role: New Grad SWE · Result: No offer
- Three technical rounds: linked lists, arrays and hash tables, then graphs and backtracking. No exact prompts were shared.
- HR covered prior experience and collaboration.
- The final round was a scalable-system design and debugging scenario: finding failures, reliability, maintainability and the reasons behind tradeoffs.
- The candidate praised the conversations and was still looking for a new grad role afterward.
Patterns across the reports
- Projects first, then code. Seven of eight reports opened with or included a project, internship or experience deep dive (01, 02, 03, 05, 06, 07, 08), up to 20 minutes in 02.
- Strong rounds did not guarantee an offer. Candidates in 03 and 08 felt the full loop went well and got no offer; 02 struggled with a trie and still got one.
Common questions
How many rounds is the Bloomberg new grad interview?
Five in the reports that listed them: a screen, two more technical rounds, HR and an engineering manager (03, 08). In 02 one technical slot turned out to be a data-structure design question.
What coding questions does Bloomberg ask new grads in 2026?
Named tasks here: a five-minute active-user counter and Mutable Stock Price Top K (01), a document-enrichment stream (04), Count Ships and Decode String (05), Flatten a Multilevel Doubly Linked List (06), and Two City Scheduling plus station connectivity (07).
Does Bloomberg ask system design for new grad roles?
Sometimes, in a light form: 08 had a scalable-system design and debugging final, while 02's "system design" round was really a data-structure question.
How long does the Bloomberg new grad process take?
In 02, feedback took two weeks and the final invite almost another month, from a late-November first contact to an April offer.
Keep practicing
- From this part: Active Users in a Five-Minute Window and Mutable Stock Price Top K (01), Document Enrichment Stream Aggregator (04), Decode String (05), Flatten a Multilevel Doubly Linked List (06), Two City Scheduling and Mutual Station Connectivity Queries (07).
- Named in Part 2: Wordle feedback and a to-do list design (11), Insert Delete GetRandom O(1) (10, 12, 16), grid defense and Shortest Path with Obstacle Elimination (16), and from 20 the social-graph partner task, episode retention threshold, equity price statistics and distributed commit log.
- Named in Part 3: Invalid Transactions and a fair registration queue (24), fuel-aware grid reachability (26), the top-N news system (28), phonebook autocomplete (29) and LRU Cache (31).
- Named in Part 4: run-length encoding and Design Browser History (44), Meeting Rooms II (45), the streaming palindrome checker (46), and from 50 the N-ary minimum-cost path and Design Underground System.
- Named in Part 5: Connect Four lines (Short 20), Blackjack table design (Short 22) and Remove Adjacent Duplicates II (Short 26, 46).
- More Bloomberg tasks from the series question list: Valid Anagram, Group Anagrams, equal frequency after one removal, string from binary-tree columns, Merge Intervals by Type and a card deck, hand and dealer design.
- Bloomberg coding bank, LLD bank and system design bank: every Bloomberg question by type (sign-in needed).
- Bloomberg interview guide and Bloomberg hiring insights: stages and recent hiring signals.
- Bloomberg new grad AI-assisted coding rounds and the Bloomberg intern AI-assisted coding round: Bloomberg's newer AI-assisted format.
- Experience feed: interview reports from other companies.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.