Quick study sessions to strengthen memory and retain key concepts.
What are the consequences of using mutable objects in a HashSet?
Mutating objects can break HashSet's unique element guarantee. If an object changes after being added to a HashSet,…
View Card →Tradeoffs: When should you use a Set over a List?
Use a Set when you need to ensure uniqueness and don't care about order. A Set is best…
View Card →What could go wrong if equals() is not correctly overridden?
Incorrect equals() can lead to unexpected duplicates in HashSet. Without correctly overriding equals(), HashSet may fail to identify…
View Card →How does HashSet perform membership checks efficiently?
HashSet uses hash tables, making membership checks typically O(1). HashSet uses a hash table to store elements, allowing…
View Card →Why is overriding hashCode() important for objects in a HashSet?
Overriding hashCode() ensures correct handling of object uniqueness. When using custom objects in a HashSet, you must override…
View Card →What makes a HashSet different from a List?
A HashSet ensures all elements are unique, unlike a List. A HashSet automatically prevents duplicate entries, making it…
View Card →How can you verify if a HashSet is empty?
Use the isEmpty() method to check if a HashSet is empty. The isEmpty() method returns true if the…
View Card →Discuss the consequences of using improper equals() in HashSet?
Improper equals() can lead to logical duplicates and data integrity issues. An incorrect equals() implementation may cause HashSet…
View Card →How does HashSet handle hash collisions?
HashSet uses linked lists to handle hash collisions. When two objects produce the same hash code, HashSet stores…
View Card →Explain how HashSet handles null values?
HashSet allows one null element and treats it as unique. HashSet can contain a single null value because…
View Card →