O(1) Insert Delete Get-Min | Dataford Interview Questions

Design a data structure that supports insert, delete, and get-minimum operations, all in O(1) time complexity.

Assume delete(value) may remove any existing value, including the current minimum. Explain whether the requirement is achievable for arbitrary comparable values, and implement process_operations(operations) using the closest practical design if it is not.

Each operation is ['insert', value], ['delete', value], or ['get-min']; return the results of all get-min operations, using None when the structure is empty.

Constraints

1 <= operations.length <= 1000
Each operation is one of ['insert', value], ['delete', value], or ['get-min']
Values are integers in the range -10^9 to 10^9
delete removes at most one occurrence and is ignored when the value is absent
Return one result for every get-min operation

Function Signature

def process_operations(operations):

Your question is O(1) Insert Delete Get-Min. 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

Design a data structure that supports insert, delete, and get-minimum operations, all in O(1) time complexity.

Each operation is ['insert', value], ['delete', value], or ['get-min']; return the results of all get-min operations, using None when the structure is empty.

Constraints

1 <= operations.length <= 1000
Each operation is one of ['insert', value], ['delete', value], or ['get-min']
Values are integers in the range -10^9 to 10^9
delete removes at most one occurrence and is ignored when the value is absent
Return one result for every get-min operation

Function Signature

def process_operations(operations):

Your question is O(1) Insert Delete Get-Min. 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.