Bloomberg Coding Interview Questions
22 problems · 3 Easy 19 Medium 0 Hard
Bloomberg problems
Bloomberg asks a high volume of medium problems focused on core data structures: hash maps, heaps, and arrays. The loop is fast-paced with multiple 45-minute rounds, so correctness under time pressure and quick iteration matter more than novel algorithms.
Two Pointers 2 problems
| Container With Most Water | Medium | ||
| Move Zeroes | Easy |
Stack 4 problems
| Valid Parentheses | Easy | ||
| Min Stack | Medium | ||
| Decode String | Medium | ||
| Asteroid Collision | Medium |
Trees / DFS 3 problems
| Validate Binary Search Tree | Medium | ||
| Path Sum II | Medium | ||
| Flatten Binary Tree to Linked List | Medium |
Dynamic Programming 3 problems
| Longest Common Subsequence | Medium | ||
| Word Break | Medium | ||
| Palindromic Substrings | Medium |
Backtracking 2 problems
| Subsets | Medium | ||
| Word Search | Medium |
Trie 1 problems
Bit Manipulation 1 problems
| Single Number | Easy |
Queue / BFS 1 problems
Heap / Priority Queue 1 problems
| Top K Frequent Words | Medium |
Linked List 2 problems
| Add Two Numbers | Medium | ||
| Swap Nodes in Pairs | Medium |
Monotonic Stack 1 problems
| 132 Pattern | Medium |
Sliding Window 1 problems