Heaps & Intervals

Ranges and rankings sit close to the surface of what Dropbox builds. That is why this family earns a lesson of its own, even though it is a narrower slice of the coding loop than arrays or trees. A file is split into fixed blocks, each block addressed by the hash of its contents, and a sync only moves the blocks that changed. That leaves the server tracking which byte ranges of a file have arrived and which are still pending. Many devices push and pull at once, so something has to count how many transfers overlap in time. A storage dashboard wants the few namespaces eating the most space out of millions. Each of those is an interval or a heap question underneath the product framing, and the pattern is worth having ready.

The bar in these rounds is steady. The CodeSignal assessment and the onsite coding rounds both run in an executable environment, and a part does not count until your code passes every hidden case in it. So the interviewer wants a full implementation that clears the edges, plus a spoken read of the time and space cost. Dropbox also leans on concurrency more than most loops its size, and the interval problems are where that shows first: counting simultaneous transfers is the same reasoning as counting simultaneous meetings. Get the base version running cleanly and you buy room for the extension that almost always follows.