Insert Delete GetRandom O(1)

Explore how to design a random set data structure supporting Insert, Delete, and GetRandom operations with average O(1) complexity. This lesson helps you understand and implement these operations efficiently, preparing you for coding interviews focusing on custom data structures.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

Implement a Random Set data structure that can perform the following operations:

Constructor(): This initializes the Random Set object.
Insert(): This function takes an integer, data, as its parameter and, if it does not already exist in the set, add it to the set, returning TRUE. If the integer already exists in the set, the function returns FALSE.
Delete(): This function takes an integer, data, as its parameter and, if it exists in the set, removes it, returning TRUE. If the integer does not exist in the set, the function returns FALSE.
GetRandom(): This function takes no parameters. It returns an integer chosen at random from the set.

Note: Your implementation should aim to have a running time of $O (1$ ...