Bloomberg Coding Interview Questions

An infinite social feed that scrolls at 60 fps, paginates without losing your place, and handles optimistic likes.

Five escalating takes on one bracket string: validate it, point editor squigglies at it, mine the longest valid substring, repair a broken file, and validate with a corruptable wildcard.

Serialize a list of arbitrary strings into a single string and parse it back. Any character is allowed in the strings, including the delimiters - the format must round-trip them all.

Given a list of half-open meeting intervals, find the minimum number of conference rooms; later phases assign specific room IDs and add capped capacity with priority eviction.

Bounded-memory caching: get it correct, then evict the least recently used, then make every operation O(1), then serve recency queries and TTL expiry.

Build a clean merged view of overlapping calendar intervals, then answer the queries production systems ask of it: insert a new interval, intersect two schedules, and find when everyone is free - each level a new access pattern on the same half-open interval model.

Group a binary tree's values into vertical columns: basic column grouping first, then a deterministic top-to-bottom row order, then value tie-breaks, then tree shapes deep enough to strain naive traversals.