Design a data structure that supports the following operations in Θ(1) time.
insert(x): Inserts an item x to the data structure if not already present.
remove(x): Removes an item x from the data structure if present.
search(x): Searches an item x in the data structure.
getRandom(): Returns a random element from current set of elements
We can use hashing to support first 3 operations in Θ(1) time. How to do the 4th operation? The idea is to use a resizable array (ArrayList in Java, vector in C) together with hashing. Resizable arrays support insert in Θ(1) amortized time complexity. To implement getRandom(), we can simply pick a random number from 0 to size-1 (size is the number of current elements) and return the element at that index. The hash map stores array values as keys and array indexes as values.
Following are detailed operations.
1) Check if x is already present by doing a hash map lookup.
2) If not present, then insert it at the end of the array.
3) Add in the hash table also, x is added as key and last array index as the index.
1) Check if x is present by doing a hash map lookup.
2) If present, then find its index and remove it from a hash map.
3) Swap the last element with this element in an array and remove the last element.
Swapping is done because the last element can be removed in O(1) time.
4) Update index of the last element in a hash map.
1) Generate a random number from 0 to last index.
2) Return the array element at the randomly generated index.
Do a lookup for x in hash map.
Below is the implementation of the data structure.
2 3 40
This article is contributed by Manish Gupta. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Design a data structure that supports insert, delete, getRandom in O(1) with duplicates
- Design a stack that supports getMin() in O(1) time and O(1) extra space
- Efficiently design Insert, Delete and Median queries on a set
- Treap | Set 2 (Implementation of Search, Insert and Delete)
- Design a Queue data structure to get minimum or maximum in O(1) time
- Queries to insert, delete one occurrence of a number and print the least and most frequent element
- Design and Implement Special Stack Data Structure | Added Space Optimized Version
- Design an efficient data structure for given operations
- Design a data structure for LRU Cache
- Trie | (Insert and Search)
- K Dimensional Tree | Set 1 (Search and Insert)
- 2-3 Trees | (Search and Insert)
- Binary Search Tree | Set 2 (Delete)
- Binary Search Tree | Set 1 (Search and Insertion)
- Anagram Substring Search (Or Search for all permutations)
- Connect nodes at same level using constant extra space
- LCA for n-ary Tree | Constant Query O(1)
- Data Structure for Dictionary and Spell Checker?
- Trie Data Structure using smart pointer and OOP in C++
- Design data structures and algorithms for in-memory file system