← Back to Interview Questions

Bloomberg LeetCode Problems

40 most frequently asked LeetCode problems in Bloomberg technical interviews

Difficulty breakdown: 14 Easy, 22 Medium, 4 Hard

Ace Your Bloomberg Interview

Don't just study these problems — get real-time AI assistance during your actual interview with Interview Solver.

Try Free
ProblemDiff
Merge Intervals
100%
M
→
Insert Delete GetRandom O(1)
100%
M
→
Invalid Transactions
100%
M
→
Two Sum
86%
E
→
Number of Islands
86%
M
→
LRU Cache
82%
M
→
Remove All Adjacent Duplicates in String II
82%
M
→
Add Two Numbers
76%
M
→
Valid Parentheses
76%
E
→
Subsets
76%
M
→
Word Search
76%
M
→
Valid Anagram
76%
E
→
Minimum Absolute Difference
76%
E
→
Sort Integers by The Power Value
76%
M
→
Maximum Nesting Depth of the Parentheses
76%
E
→
Combination Sum
68%
M
→
Search a 2D Matrix
68%
M
→
Merge Sorted Array
68%
E
→
Longest Consecutive Sequence
68%
M
→
Meeting Rooms II
68%
M
→
Binary Tree Vertical Order Traversal
68%
M
→
Decode String
68%
M
→
Number of Ships in a Rectangle
68%
H
→
Design an Ordered Stream
68%
E
→
Minimum Limit of Balls in a Bag
68%
M
→
Remove Letter To Equalize Frequency
68%
E
→
Palindrome Number
57%
E
→
Merge Two Sorted Lists
57%
E
→
Trapping Rain Water
57%
H
→
Word Ladder
57%
H
→
Word Break II
57%
H
→
House Robber
57%
M
→
Is Subsequence
57%
E
→
Two City Scheduling
57%
M
→
Check If N and Its Double Exist
57%
E
→
Count Unhappy Friends
57%
M
→
Dot Product of Two Sparse Vectors
57%
M
→
Recyclable and Low Fat Products
57%
E
→
Add Two Integers
57%
E
→
Find Score of an Array After Marking All Elements
57%
M
→