Search⌘ K
Home
Courses
Decode the Coding Interview in Go: Real-World Examples

DIY: Insert Delete GetRandom O(1) - Duplicates Allowed

Explore how to implement a set that allows duplicates and performs insert, delete, and getRandom operations in average constant time. Understand how to handle duplicates efficiently while maintaining quick random access, preparing you for coding interviews with real-world challenges.

We'll cover the following...

Problem statement

Implement a set data structure that allows duplicates and can perform the following operations:

  • insert(data): This function should insert data into the set (if the set does not contain it already). It should return false if the data already exists in the set. Otherwise, it should return true.
  • remove(data): If the data is present, this function should remove data from the set and return true. If the data does not exist in the set, the function should return false.
  • getRandom(): This function should return a random element from the set in constant time.

Note: Your implementation should aim for constant running time (on average) for each operation. ...

Constraints