Bloomberg·Software Engineer·Onsite - Coding / Algorithms
Jun 2026
Bloomberg SWE coding round, one meaty design-and-implement question that took up the whole session. More involved than a typical LeetCode problem since you had to think through data structure choices, edge cases, and write actual tests.
- Build an in-memory LRU cache where each entry has a variable byte size. The cache supports get, set, delete, and resize operations. Capacity is a byte budget, not an item count. Evictions happen on insert and resize. A single entry larger than the capacity should be rejected. Aim for O(1) amortized on reads and writes, and write unit tests covering size-changing updates, eviction ordering, edge deletions, and capacity reduction.
“This one had a lot of moving parts and I underestimated the resize case early on.” The rest of the author's notes on Software Engineer interview at Bloomberg, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post