Bloomberg interview process (2026)
Round-by-round breakdown of the Bloomberg software engineering interview across 3 levels and 14 rounds: interview mode, sample questions, and worked solutions.
Software Engineer Intern (Pune)
Difficulty: Medium · Timeline: ~2-3 months · Recommended prep: 6-10 weeks · Cooldown: ~6-12 months
-
Round 0: Online Assessment (HackerRank) — campus drives only (not confirmed for the intern track)
Assessment · ~90 minutes · difficulty 2/5 · elimination round
Mode of interview: Online assessment · HackerRank
Sample question: Merge Intervals — Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.
-
Round 1: Technical Interview 1 — DSA / design-flavored coding (HackerRank CodePair)
Phone · 45-60 minutes · difficulty 2/5 · elimination round
Mode of interview: Live interview · HackerRank CodePair
Sample question: Insert Delete GetRandom O(1) — Design a data structure (RandomizedSet) that supports insert(val), remove(val), and getRandom() each in average O(1) time. insert/remove return whether the element was present; getRandom returns a uniformly random current element.
-
Round 2: Technical Interview 2 — DSA + CS fundamentals (OS-heavy)
Onsite · ~60 minutes · difficulty 3/5 · elimination round
Mode of interview: Onsite or virtual onsite interview
Sample question: Minimum Remove to Make Valid Parentheses — Given a string of '(' , ')' and lowercase letters, remove the minimum number of parentheses so the resulting string is valid (every open has a matching close and vice versa). Return any valid result.
-
Round 3: HR / Managerial round
Behavioral · ~30-60 minutes · difficulty 1/5
Mode of interview: Live behavioral interview
Software Engineer (New Grad / Entry-Level) - India (Pune)
Difficulty: Hard · Timeline: 1-2 weeks · Recommended prep: ~6-10 weeks · Cooldown: ~6-12 months
-
Round 0: Online Assessment (HackerRank)
Assessment · ~90 minutes · difficulty 3/5 · elimination round
Mode of interview: Online assessment
Sample question: LRU Cache — Design a data structure for a Least Recently Used (LRU) cache with a fixed capacity. Support get(key) returning the value or -1, and put(key, value); when capacity is exceeded evict the least recently used entry. Both operations must run in O(1).
-
Round 1: DSA / Coding Technical Round(s)
Phone · ~60 minutes · difficulty 3/5 · elimination round
Mode of interview: Remote phone or video interview
Sample question: Number of Islands — Given an m x n 2D binary grid of '1' (land) and '0' (water), count the number of islands. An island is formed by connecting adjacent lands horizontally or vertically.
-
Round 2: System Design Round
System_design · ~60 minutes · difficulty 2/5 · elimination round
Mode of interview: Live system design interview
Sample question: Insert Delete GetRandom O(1) — Design a data structure (RandomizedSet) supporting insert(val), remove(val), and getRandom() each in average O(1) time. insert/remove return whether the element was actually inserted/removed; getRandom returns a uniformly random current element. Implement with a dynamic array plus a value->index hash map (swap-with-last on delete).
-
Round 3: Managerial / HR Round
Behavioral · ~30-60 minutes · difficulty 2/5 · elimination round
Mode of interview: Live behavioral interview
Senior Software Engineer / Experienced Hire - India (Pune)
Difficulty: Hard · Timeline: ~3-7 weeks · Recommended prep: ~8-12 weeks · Cooldown: ~6-12 months
-
Round 0: Recruiter Screen
Phone · 30-45 minutes · difficulty 1/5 · elimination round
Mode of interview: Remote phone or video interview
-
Round 1: Technical Phone Screen (HackerRank + Zoom)
Phone · ~60 minutes · difficulty 3/5 · elimination round
Mode of interview: Remote phone or video interview
Sample question: Trapping Rain Water — Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Solve in O(n) time and O(1) extra space.
-
Round 2: Virtual Onsite Loop - Coding
Onsite · ~45-60 minutes · difficulty 3/5
Mode of interview: Onsite or virtual onsite interview
Sample question: Word Ladder — Given beginWord, endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, changing exactly one letter at a time, where each intermediate word must be in wordList. Return 0 if no such sequence exists.
-
Round 3: Virtual Onsite Loop - Code Review
Other · ~45-60 minutes · difficulty 3/5
Mode of interview: Interview format varies by team
-
Round 4: Virtual Onsite Loop - System Design
System_design · ~45-60 minutes · difficulty 4/5
Mode of interview: Live system design interview
Sample question: Design a Real-Time Stock Ticker / Market Data Service — Design a system that ingests millions of market-data updates per second and streams real-time stock price updates to a large number of Bloomberg Terminal clients with ultra-low latency and no data loss. Discuss feed handlers (UDP multicast ingestion + normalization), a lock-free processing/dedup/ordering layer, fan-out via pub/sub to WebSocket edge servers, backpressure, throughput vs latency trade-offs, and reliability/failover across regions.
-
Round 5: Behavioral / Engineering Manager Round
Behavioral · ~30-60 minutes · difficulty 2/5
Mode of interview: Live behavioral interview
Other companies' interview processes
Worked sample solutions (code, design diagrams, and STAR answers) for every round are available in the FAANGPlus app: open interview processes.