Resource Allocation Under Memory Constraints | Dataford Interview Questions

Implement a custom data structure or algorithm to solve a specific resource-allocation problem under tight memory constraints.

Use a single bitset-style representation to manage capacity contiguous resource slots. Implement allocation using first-fit placement and support releasing previously allocated ranges.

Contract

Implement def allocate_resources(capacity, operations):. Each operation is ['allocate', size] or ['release', start, size]. Return the starting index for every allocation, or -1 when no contiguous block is available. Release operations produce no output.

Constraints

1 <= capacity <= 1000000
1 <= len(operations) <= 500
1 <= size <= capacity
Allocation operations have the form ['allocate', size].
Release operations have the form ['release', start, size].
Every release describes a valid allocated range.
Allocation uses the lowest possible starting index.

Function Signature

def allocate_resources(capacity, operations):

Your question is Resource Allocation Under Memory Constraints. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem