Insert Delete GetRandom | Dataford Interview Questions

Insert Delete GetRandom O(1)

Asked in the Coding 1 stage. Implement a data structure supporting insertion, deletion, and returning a random stored value, each in average O(1) time. Reported follow-up: extend the solution to allow duplicates.

For grading, implement randomized_set(operations). Each operation is ['insert', value], ['delete', value], or ['getRandom']. Return a list containing Boolean results for insert/delete and the selected value for getRandom. getRandom is called only when the set is non-empty.

Constraints

1 <= len(operations) <= 1000
Each value is an integer
An operation is insert, delete, or getRandom
getRandom is called only when at least one value is stored
Duplicate values are rejected

Function Signature

def randomized_set(operations):

Your question is Insert Delete GetRandom. 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

Insert Delete GetRandom O(1)

Constraints

1 <= len(operations) <= 1000
Each value is an integer
An operation is insert, delete, or getRandom
getRandom is called only when at least one value is stored
Duplicate values are rejected

Function Signature

def randomized_set(operations):

Your question is Insert Delete GetRandom. 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.