Data structure: insert, remove, contains, get random element, all at O(1)

Question

I was given this problem in an interview. How would you have answered?

Design a data structure that offers the following operations in O(1) time:

• inse

Answer 1

Why don't we use epoch%arraysize to find random element. Finding array size is O(n) but amortized complexity will be O(1).