What is the time complexity of contains() operation in HashSet?
Last Updated :
Discuss
Comments
What is the time complexity of contains() operation in HashSet?
O(1)
O(n)
O(log n)
O(n log n)
This question is part of this quiz :
Java Set and HashSet ClassesTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy