Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 314. Binary Tree Vertical Order Traversal | Medium | ||
| 394. Decode String | Medium | ||
| 726. Number of Atoms | Hard | ||
| 3. Longest Substring Without Repeating Characters | Medium | ||
| 2590. Design a Todo List | Medium | ||
| 102. Binary Tree Level Order Traversal | Medium | ||
| 39. Combination Sum | Medium | ||
| 611. Valid Triangle Number | Medium | ||
| 22. Generate Parentheses | Medium | ||
| 88. Merge Sorted Array | Easy | ||
| ๐ | 35. Search Insert Position | Binary Search | Easy |
| ๐ | 55. Jump Game | Misc.Dynamic Programming | Medium |
| ๐ | 34. Find First and Last Position of Element in Sorted Array | Binary Search | Medium |
| ๐ | 9. Palindrome Number | Basic DSA | Easy |
| ๐ | 94. Binary Tree Inorder Traversal | Depth-First Search | Easy |
| ๐ | 560. Subarray Sum Equals K | Two Pointers | Medium |
| ๐ | 78. Subsets | Backtracking | Medium |
| ๐ | 80. Remove Duplicates from Sorted Array II | Two Pointers | Medium |
| ๐ | 152. Maximum Product Subarray | Dynamic Programming | Medium |
| ๐ | 27. Remove Element | Two Pointers | Easy |
| ๐ | 876. Middle of the Linked List | Basic DSATwo Pointers | Easy |
| ๐ | 17. Letter Combinations of a Phone Number | Backtracking | Medium |
| ๐ | 11. Container With Most Water | Misc.Two Pointers | Medium |
| ๐ | 206. Reverse Linked List | BacktrackingBasic DSA | Easy |
| ๐ | 605. Can Place Flowers | Misc. | Easy |
| ๐ | 7. Reverse Integer | Basic DSA | Medium |
| ๐ | 242. Valid Anagram | Basic DSA | Easy |
| ๐ | 33. Search in Rotated Sorted Array | Binary Search | Medium |
| ๐ | 13. Roman to Integer | Basic DSA | Easy |
| ๐ | 26. Remove Duplicates from Sorted Array | Two Pointers | Easy |
| ๐ | 67. Add Binary | Simulation | Easy |
| ๐ | 23. Merge k Sorted Lists | Basic DSAMisc. | Hard |
| ๐ | 5. Longest Palindromic Substring | Two PointersDynamic Programming | Medium |
| ๐ | 40. Combination Sum II | Backtracking | Medium |
| ๐ | 61. Rotate List | Basic DSATwo Pointers | Medium |
| ๐ | 12. Integer to Roman | Basic DSA | Medium |
| ๐ | 75. Sort Colors | Two PointersBasic DSA | Medium |
| ๐ | 128. Longest Consecutive Sequence | Adv. Data Structure | Medium |
| ๐ | 50. Pow(x, n) | Backtracking | Medium |
| ๐ | 112. Path Sum | Depth-First SearchBreadth-First Search | Easy |
| ๐ | 739. Daily Temperatures | Misc. | Medium |
| ๐ | 198. House Robber | Dynamic Programming | Medium |
| ๐ | 25. Reverse Nodes in k-Group | BacktrackingBasic DSA | Hard |
| ๐ | 231. Power of Two | Backtracking | Easy |
| ๐ | 73. Set Matrix Zeroes | Basic DSA | Medium |
| ๐ | 1480. Running Sum of 1d Array | Two Pointers | Easy |
| ๐ | 345. Reverse Vowels of a String | Two Pointers | Easy |
| ๐ | 41. First Missing Positive | Basic DSA | Hard |
| ๐ | 215. Kth Largest Element in an Array | Misc.Basic DSA | Medium |
| ๐ | 733. Flood Fill | Depth-First SearchBreadth-First Search | Easy |
| ๐ | 322. Coin Change | Breadth-First SearchDynamic Programming | Medium |
| ๐ | 45. Jump Game II | Misc.Dynamic Programming | Medium |
| ๐ | 295. Find Median from Data Stream | Two PointersBasic DSA | Hard |
| ๐ | 62. Unique Paths | Dynamic Programming | Medium |
| ๐ | 162. Find Peak Element | Binary Search | Medium |
| ๐ | 994. Rotting Oranges | Breadth-First Search | Medium |
| ๐ | 237. Delete Node in a Linked List | Basic DSA | Medium |
| ๐ | 543. Diameter of Binary Tree | Depth-First Search | Easy |
Sign up for free to track your progress, then upgrade to Pro for all 58 questions with detailed solutions.
Sign Up FreeBloomberg's interview process begins with an initial resume screening to assess candidates' educational background and relevant experience. Those who pass this stage typically encounter one or two online assessments (OA) focusing on coding and problem-solving skills, which can be quite challenging and are crucial for moving forward in the process.
Following the online assessments, candidates generally proceed to one or two phone interviews. These conversations aim to evaluate candidates' technical ability as well as cultural fit. Successful candidates are then invited to an onsite interview, which can consist of multiple rounds with different team members, further evaluating coding skills, system design, and communication abilities. The process is known for its rigor and thoroughness.
Bloomberg's initial screening includes a detailed review of the applicant's resume, focusing on relevant software engineering experience and specific skills. Candidates may be required to complete Online Assessments (OAs) that test coding proficiency and problem-solving skills.
Following the resume review, selected candidates undergo a preliminary phone or video interview. This call typically involves behavioral questions and possibly some technical inquiries to gauge coding knowledge and logical thinking abilities.
Bloomberg's interview process typically begins with one or two phone screens. These initial conversations focus on assessing technical skills and problem-solving abilities, often involving coding exercises or algorithm questions that candidates need to verbalize their thought process for.
The phone interviews also delve into a candidateโs experience and understanding of software development principles. This is an opportunity for applicants to demonstrate how their background and skills align with the responsibilities of the position they're applying to at Bloomberg.
During Bloomberg's onsite interview rounds, candidates typically undergo three to four interviews. These sessions focus on coding skills, system design, and problem-solving abilities. Each interview lasts about an hour and is highly technical, emphasizing hands-on coding and design expertise.
Candidates can also expect a behavioral interview to evaluate their fit within Bloomberg's corporate culture. This is not just about technical ability but also interpersonal skills, communication, and adaptability. Itโs a crucial part of the process and helps ensure a mutual fit.
After concluding the interview rounds at Bloomberg, candidates may undergo team matching to ensure a good fit. This phase could also involve meetings with executives, followed by offer negotiations to finalize employment terms.

When preparing for a coding interview at Bloomberg, focusing on mastering certain problem patterns can increase your chances of success. According to data aggregated from LeetCode, the most frequently encountered patterns are Two Pointers, Basic DSA, and Backtracking. BFS/DFS traversal and Graph Theory seems to be less common with Bloomberg, although they are still very important topics that could show up. Dynamic Programming problems are also more present on the Bloomberg interview than average.
Tell me about a time when you had to learn a new technology to complete a project.
Describe a situation where you had to collaborate with a team that had differing opinions.
Can you share an experience where you had to handle a high-pressure situation in a previous job?
Describe a time when you had to collaborate with a team to solve a difficult problem. What was your role, and what was the outcome?
Can you share an experience where you helped improve a teamโs performance or process? What steps did you take?
Bloomberg prides itself on innovation and collaboration. Can you discuss a project where you innovated with a team to create a new software solution?
Describe a time when you had to work on a project with tight deadlines and limited resources. How did you manage your priorities, and what was the outcome?
Tell me about a software project you developed that you're particularly proud of. What challenges did you face, and how did you overcome them?
Bloomberg values innovation in improving data accessibility. Can you discuss a project or an instance where you improved the efficiency or accessibility of data in a previous role?