Design a Set with $O(1)$ `insert`, `remove`, and `getRandom`

Question

Accepted Answer

Design a data structure that supports inserting a value, removing a value, and getting a random element, all in $O(1)$ average time. This requires combining an Array and a Hash Map.

Design a Set with $O(1)$ `insert`, `remove`, and `getRandom`

Question Explain

Start Trying This Question Simulation

Other interview questions like this

Reverse a Linked List

Kth Smallest Element in a BST

Lowest Common Ancestor of a BST