Implement a disk space manager with eviction

Q: Implement a disk space manager with eviction

This question evaluates understanding of in-memory resource management, capacity accounting, eviction policies, and data-structure design for efficient dataset lookup and size tracking in the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design and implement an in-memory disk space manager that stores datasets by datasetId with a given size (e.g., in MB). The manager has a fixed total capacity (total space), not a limit on the number of datasets.

You must support:

put(datasetId, size)

If size > totalCapacity , return an error (the dataset can never fit).
If there is enough free space, store/update this dataset.
If there is not enough free space, you may evict other datasets to free space (eviction policy is up to you, e.g., LRU).
If after evicting everything possible the dataset still cannot fit, return an error.

get(datasetId)

Return the stored size for that dataset if present; otherwise indicate “not found”.

Clarify/handle updates: if put is called for an existing datasetId, treat it as replacing the old size (adjust used space accordingly).

Implement the class/API in the language of your choice (e.g., Java).

Implement a disk space manager with eviction

Quick Overview

Comments (0)