Aggregated from 3 candidate experiences for ALL.
Bloomberg LP’s hiring process for technical roles is rigorous and multi-staged, emphasizing problem-solving, system design, and cultural fit. Rejection often hinges on performance in later rounds, even after strong initial performances, as seen in repeated cases where candidates excelled in early stages but struggled later. The process typically includes a mix of algorithmic challenges, system design discussions, and HR evaluations, reflecting Bloomberg’s focus on both technical depth and long-term potential.
The candidate underwent a technical phone screen, two technical rounds (algorithmic and system design), and an HR round. They received a selection call from HR after 10 days.
A 51-minute technical phone interview conducted on Hackerrank Code Pair. The round included trivia questions on OOP concepts and one Leetcode Medium algorithmic coding question with a follow-up.
A 45-minute round with two interviewers. One question was to be written on paper, and the other was to be coded on Hackerrank Code Pair. The difficulty was Leetcode Easy-Medium.
A more than 1-hour interview with a team manager. The round involved general discussion about the candidate's interest in CS, reasons for joining Bloomberg, and career aspirations. The manager explained a problem the team works on, discussed various approaches to solve it under different constraints, and asked the candidate to write simple code for one proposed solution.
A 30-minute round focused on detailed discussion about the candidate's resume, past experiences, and internships. The round also included general chat about career paths at Bloomberg and HR-related questions like future aspirations.
The candidate described a positive interview experience with Bloomberg LP, highlighting friendly and collaborative interviewers. Despite performing well in the first on-site round, the candidate was ultimately rejected, possibly due to performance in the second round.
The phone screen involved a basic introduction followed by two technical questions.
Find the intersection point of two linked lists.
Sort a string based on the frequency of characters in descending order. For characters with the same frequency, sort them lexicographically.
The first on-site technical round began with an introduction and a deep dive into a project from the resume, followed by two technical questions.
Perform a zigzag level order traversal of a binary tree.
Implement an LRU cache.
The second on-site technical round began with an introduction and a deep dive into a project from the resume, followed by one technical question.
Determine if a given string can be segmented into a space-separated sequence of dictionary words.
InterviewDigest