Search⌘ K
AI Features

DIY: Insert, Delete, and GetRandom in O(1)

Explore how to implement a set data structure in Elixir with operations to insert, delete, and return random elements all in constant time. Understand the algorithms and design patterns needed to solve Amazon-style interview problems efficiently.

Problem statement

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

  • insert(obj, 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.
...