Question

Propose a data structure for the following:
- The data structure would hold elements from 0 to N-1.
- There is no order on the elements (no ascending/descending order requirement)

The complexity of the operations should be as follows:
* Initialization - O(1)
* Insertion of an element - O(1)
* Deletion of an element - O(1)
* Finding a element - O(1)
* Deleting all elements - O(1)

Answer 1

You can use the Hashing for the given purpose, it has all the given operations Initialization, Insertion, Deletion, Search and Deletion of 0(1). In hashing we take a key and apply the hash function which tells us the location of the element.

You can google, there are many opensource implementation available in almost all language.