← Flipkart questions

Data structure supporting insert, remove, contains and get random at O(1)

Filed under Flipkart

Design a data structure that supports insert, remove, contains, and getting a random element, all in O(1) average time complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.