What is the difference between hashset and hashtable?
- 1 Answers
- 1070 Views
- I also Faced
- E-Mail Answers
Answer / Sandeep Bajpai
A HashSet is a collection of unique elements, while a Hashtable (or Dictionary) is a data structure that stores key-value pairs. A Hashtable can have duplicate keys if you allow it, but a HashSet cannot.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can nsarray contain nil?
Which is faster hashset or treeset?
What are the advantages of merge sort?
Advanced problems related to Data Structures were asked
Is an arraylist an object?
Which interfaces are implemented by printerstatereasons?
In tree construction which is the suitable efficient data structure?
Why is quicksort better than mergesort?
How do you sort an array in descending order?
how to find the number of possible tree in the given tree.
12 Answers Persistent, TCS, Wipro,
Are hash tables ordered?
What is complexity of bubble sort?
Windows 
