Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Rust: Real-World Examples

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

Explore how to implement a data structure allowing duplicates that supports insert, delete, and getRandom operations in average constant time. This lesson helps you understand efficient coding solutions for complex set operations useful for Amazon-style interview problems.

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