codemistic / Data-Structures-and-Algorithms

A repository to help the open-source community with DSA related contributions
MIT License
354 stars 342 forks source link

create design-hashset.java #460

Closed Aman5989 closed 1 year ago

Aman5989 commented 1 year ago

Hi,

The implementation that I thought was to go for a boolean array with size 10^6 +2.

And this is easy to add and remove the element in the boolean array.

Just return that boolean element to find whether it contains in set function.

Please add hacktoberfest tags.