Design a Get/Set Random Structure | Dataford Interview Questions

Design a data structure supporting insert, remove and getRandom in O(1)

Asked in the Coding stage.

Implement randomized_set(operations, seed). Each operation is ['insert', value], ['remove', value], or ['getRandom']. Return one result per operation: insertion and removal return booleans, while getRandom returns a uniformly selected stored value. The supplied seed makes random results deterministic for grading. getRandom is called only when the set is non-empty.

Constraints

Values are integers.
Duplicate values are not stored.
1 <= len(operations) <= 10^4.
Each operation is insert, remove, or getRandom.
Every getRandom operation occurs while the set is non-empty.

Function Signature

def randomized_set(operations, seed):

Your question is Design a Get/Set Random Structure. 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 supporting insert, remove and getRandom in O(1)

Asked in the Coding stage.

Constraints

Values are integers.
Duplicate values are not stored.
1 <= len(operations) <= 10^4.
Each operation is insert, remove, or getRandom.
Every getRandom operation occurs while the set is non-empty.

Function Signature

def randomized_set(operations, seed):

Your question is Design a Get/Set Random Structure. 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.