11 Bloomberg LP Software Engineer (Intern) Interview Questions (2026)
Bloomberg's intern SWE loop in 2026 is a recruiter screen, an online coding assessment via HackerRank, and two virtual technical interviews. The bar is slightly lower than new-grad — fundamentals over esoteric problems — but interviewers still expect clean code, complexity analysis, and curiosity about Bloomberg's financial-data domain.
By Sam K., Founder, InterviewChamp.AI · Last verified
Loop overview
Intern candidates report a 3-5 week timeline in 2026. HackerRank online assessment (2 problems, 60-90 minutes), then two 45-minute technical interviews. Bloomberg recruits heavily on-campus for sophomore/junior internships and runs a structured 10-12 week summer program in NYC, London, and Princeton. Stack exposure is C++, Python, and JavaScript depending on team placement.
Behavioral (3)
Why do you want to intern at Bloomberg?
Frequently askedOutline
Be specific: the structured intern program (formal training, project mentorship), exposure to financial data at scale, the C++ apprenticeship, NYC location. Mention any market-data side projects or finance coursework. Avoid 'I want to work in fintech' — too broad.
Tell me about a project you are proud of.
Frequently askedOutline
Pick a project where you can walk through the technical choices and what you learned. Be ready for drill-down questions: why this data structure, how did you debug, what would you do differently. Bloomberg's intern interviewers care about how you think, not just what you built.
What languages and tools are you most comfortable with?
Frequently askedOutline
Be honest. Bloomberg places interns on teams based on stack fit (C++ for Terminal, Python for data, JavaScript for web). Knowing your level on each helps the recruiter match you. Don't oversell.
Coding (LeetCode patterns) (5)
Reverse a linked list.
Frequently askedOutline
Iterative with three pointers: prev, curr, next. Save next, point curr->next at prev, advance prev and curr. O(N) time, O(1) space. Recursive variant is also acceptable but uses O(N) stack. Edge cases: empty list, single node.
Given an array of integers, return the two indices whose values sum to a target.
Frequently askedOutline
Hash map. For each element, check if (target - element) is in the map; if yes return both indices. Else insert current index. O(N) time, O(N) space. Edge cases: no solution, duplicates, negative numbers.
Implement a function that checks if a string is a palindrome, ignoring non-alphanumeric characters.
Frequently askedOutline
Two pointers, one at each end. Skip non-alphanumeric, compare lowercase characters, advance both. Return false on mismatch. O(N) time, O(1) space. Edge cases: empty string (true), single character (true), mixed case.
Given a string, return the first non-repeating character.
Frequently askedOutline
Two passes. First pass: count character frequencies. Second pass: return first character with count 1. O(N) time, O(1) space (fixed alphabet). Alternative: ordered map / LinkedHashMap to do it in one pass.
Given a binary tree, return its in-order traversal.
Frequently askedOutline
Recursive: traverse left, visit node, traverse right. Iterative with stack: push lefts until null, pop and visit, then go right. O(N) time, O(H) space. Edge cases: empty tree, single node, skewed tree.
Technical (3)
What is a hash collision and how do hash tables handle it?
Frequently askedOutline
Collision = two distinct keys hashing to the same bucket. Handling: separate chaining (each bucket holds a linked list / array of entries) or open addressing (probe to next slot — linear, quadratic, double hashing). Discuss load factor and when to resize.
Explain Big-O notation and give examples of O(1), O(log N), O(N), O(N log N), and O(N^2).
Frequently askedOutline
Asymptotic upper bound on time/space as input grows. Examples: O(1) array index, O(log N) binary search, O(N) linear scan, O(N log N) merge sort, O(N^2) nested loop or naive sort. Be ready to derive the complexity of a code snippet on the spot.
What is the difference between an array and a linked list?
Frequently askedOutline
Array = contiguous memory, O(1) random access, O(N) insert/delete in middle. Linked list = nodes with pointers, O(N) access, O(1) insert/delete given pointer to node. Cache locality favors arrays. Use array for known size and frequent access; linked list for frequent middle inserts.
Bloomberg LP interview tips
- Bloomberg's intern bar emphasizes clarity over cleverness — explain your approach before coding.
- Online assessment is HackerRank — practice their interface. Standard problems, not curveballs.
- Internship placement is team-based. If you have a strong language preference (C++, Python, JS), tell your recruiter.
- The summer program runs in NYC, London, and Princeton. Confirm your location preference with the recruiter early.
- Return-offer rates for Bloomberg interns are historically high. Take the internship seriously — the conversion is real.
Frequently asked questions
How long is Bloomberg's intern interview process in 2026?
Most reports show 3-5 weeks from recruiter outreach to offer.
What programming language should I use for the Bloomberg intern interview?
Whichever you know best. Python and C++ are most common. Java and JavaScript are accepted.
Where are Bloomberg internships located?
NYC (largest cohort), London, and Princeton, NJ. Specify your preference with your recruiter.
What is the Bloomberg intern return-offer rate?
Historically high — strong interns typically get return offers. Performance during the internship matters more than the original interview.
Does Bloomberg sponsor international interns?
Bloomberg has hosted F-1 OPT interns in past US cycles and EU citizens in London. Confirm with your recruiter.
More Bloomberg LP interview questions
Software Engineer (Intern) interview questions at other companies
Related interview-prep guides
HackerRank Tech Interview Guide 2026: What It Tests, How It Tracks You, and the Modern Setup
HackerRank is a browser-sandboxed coding-assessment platform that tests algorithms, SQL, and role-specific skills, and logs every keystroke, paste, and tab-focus change inside its own tab. As of the 2026 hiring cycle it is still the volume leader in first-round technical screens. Its detection ends at the browser boundary: it sees nothing running elsewhere on your machine.
The 2026 CS New-Grad Interview Loop: Phone Screen to Offer at Every Tier
The 2026 CS new-grad interview loop runs five steps (recruiter screen, technical screen, onsite, debrief, offer) but the shape of each step now depends on tier of company. This guide maps the loop for FAANG, mid-tier public, startup, consultancy, and research lab, with 2026 timelines and how AI-fraud concerns brought in-person rounds back.
Technical Phone Screen: Tips, Questions, and Tactics for CS New Grads (2026)
A technical phone screen is a 30-60 minute coding interview on a shared editor, audio-only or light-video, that decides whether you advance to the onsite. It scores three things at once: can you clarify, code, and talk through your reasoning live. New grads who treat it as a pure coding test get rejected even with working code, because the verbal layer is half the rubric. These technical phone interview tips cover the format, the questions, 24-hour prep, and the freeze recovery that gets you to the offer.