Data structure with Insert Remove GetRandom | Dataford Interview Questions

Design a data structure supporting Insert, Remove, and GetRandom

Asked in the Tech screening (CS Fundamentals) stage. Described as "DSA Insert-Remove-GetRandom".

Implement randomized_set_operations(operations, seed). Each operation is a two-item list such as ["insert", 5], ["remove", 5], or ["getRandom", null]. Return an array containing each insert/remove result as a Boolean and each GetRandom result as an integer. The set starts empty, duplicate inserts and removals of missing values return false. For deterministic grading, initialize Python's random generator with seed before processing operations.

Constraints

Values are integers
At least one value exists before every getRandom operation
1 <= operations.length <= 10^5
Each operation is insert, remove, or getRandom

Function Signature

def randomized_set_operations(operations, seed):

Your question is Data structure with Insert Remove 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

Design a data structure supporting Insert, Remove, and GetRandom

Asked in the Tech screening (CS Fundamentals) stage. Described as "DSA Insert-Remove-GetRandom".

Constraints

Values are integers
At least one value exists before every getRandom operation
1 <= operations.length <= 10^5
Each operation is insert, remove, or getRandom

Function Signature

def randomized_set_operations(operations, seed):

Your question is Data structure with Insert Remove 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.