title: If Hashset 'add' complexity is O(1), then how unique elements are stored?
body: <p>Big-O - In order to add an element to a HashSet the complexity is O(1), then how does a HashSet determine if the element to be added is unique or not ?</p>