Bloomberg SDE 面不只看你解题，更看重你的系统思维和沟通能力。 技术面试里的算法题，比如设计一个处理连续数据流的数据结构，其实是在考察你如何用平衡二叉树（如C++的map）来优化查找和合并逻辑，处理复杂的边界情况，这背后就是系统设计的思维。 分享下最近遇到的 Bloomberg 面经 – 三轮面试，两轮是Coding，1轮HM，看的出来，彭博社还是很喜欢算法数据结构表现优异的候选人。
Bloomberg VO Timeline
Sep 21: Referral submitted
Sep 26: Application Submitted
Oct 3: Phone Interview Invitation
Oct 24: Phone Interview – 25 minutes of résumé discussion plus Why Bloomberg, followed by solving LeetCode 445.
11.28 VO邀请： on campus满了，virtual约到了12.7。
Dec 7: Back-to-back interviews
Bloomberg 面经 – VO 1
This round was a pure coding interview. After a brief self-introduction of about five minutes, we moved on to solving coding problems.
Question 1: Given an array, you may delete at most one number (or delete none). Determine whether it’s possible to make the frequency of occurrence of every number the same.
Problem-solving ideas:可以先用哈希表freq记录每种数字出现的次数，然后再使用哈希表freq_of_freq记录每种次数出现的次数 然后如果freq_of_freq长度为1，也就是只有一种长度，那就可以不删 如果freq_of_freq长度为2，那么记其中的两种次数以及次数的次数分别为(f1, v1)和(f2, v2)，如果其中一个v等于1，且对应的f也等于1，或者等于另一个f加1，那么把这个v对应的字符删掉一个之后，v对应的f就会变成f – 1，也就是变成0，或者变成另一个f。比如aabbc，c对应的就是v和f都等于1；比如aabbccc，c对应的就是v等于1，f等于另一个f加1。
Question 2: Given an encoded string in the form of 3[a3[b]], decode it to produce the expanded string, e.g., abbbabbbabbb.
Solution approach: Use a stack simulation. Maintain a current string curr. Append letters to curr as you scan. When you see a number, push the number and the current prefix onto the stack and reset curr (skip the [). When you hit ], pop the previous string pre and repeat count f, then set curr = pre + curr repeated f times.
Bloomberg 面经 – VO 2
First, we went over my résumé for about 15 minutes, then moved on to the coding part. I was given a secret string and a guess string of the same length. For each index: if guess[i] equals secret[i], print *. Otherwise, print + if guess[i] appears somewhere in secret; if it doesn’t, print -.
As a follow-up, the interviewer asked about the time and space complexity, then modified the question to ask how the solution would change if we also needed to account for character frequencies.
Solution approach: First, put all characters from secret into a set, then iterate through the strings and output the result accordingly. The time complexity is O(n), and the space complexity is O(k).
Follow-up solution approach: Each character can only be matched a limited number of times, turning the problem into the correct counting logic used in Wordle/Bulls and Cows. Characters in the same secret string cannot be reused indefinitely for + matches. In a second pass, handle the remaining +/- cases by checking the remaining frequencies to decide whether a + can be assigned. The time and space complexities remain unchanged.
Bloomberg 面经 – VO 3
The third round was an HR interview. I was asked to introduce myself, followed by several standard behavioral questions (BQ).
- Why bloomberg？
- Most interesting project？
- What new thing did you learn about bloomberg from your previous interviews?
- Two things you are looking for when you apply to jobs?
Overall, the interview experience was very positive. The interviewers were all friendly and polite, and the communication atmosphere was open and engaging. After the interviews, the interviewer mentioned that HR would reach out soon. The official timeline is that results will be shared within seven business days. I’ll come back to update once I hear the outcome—hopefully good news will be knocking on the door.
If you also need interview coaching, such as Bloomberg interview preparation and related services, feel free to contact us. We’ve helped many candidates successfully secure offers from Bloomberg.
