Quick study sessions to strengthen memory and retain key concepts.
Why can TreeSet be less efficient than HashSet?
TreeSet has higher time complexity for operations. While TreeSet maintains elements in sorted order, it does so at…
View Card →How would you explain a TreeSet used for in an interview?
TreeSet stores unique elements in sorted order. A TreeSet automatically sorts the elements as they are added, which…
View Card →What happens if you don't override hashCode() when overriding equals()?
It can cause inconsistent behavior in collections like HashMap. If you override equals() but not hashCode(), objects that…
View Card →Why choose LinkedList over ArrayList?
LinkedList offers better performance for frequent insertions/deletions. A LinkedList is a better choice when your application requires frequent…
View Card →How would you explain a Map in a Java interview?
Maps store key-value pairs, ensuring unique keys. A Map is used when you want to associate keys with…
View Card →How does a HashMap handle collisions?
HashMap uses chaining or open addressing to handle collisions. In a HashMap, if two keys have the same…
View Card →Which feature best describes a Set?
Sets store unique elements with no duplicates. A Set is ideal when you want to ensure all elements…
View Card →Why use a List in Java?
Lists maintain insertion order and allow duplicates. A List in Java is used when you need to store…
View Card →How can you achieve immutability in a Java class?
Use final fields and no setters, initialize fields in the constructor. Immutability means the object's state cannot change…
View Card →How would you explain a potential issue with setter-heavy designs in an interview?
Setter-heavy designs can lead to fragile and less maintainable code. Relying heavily on setters can make it easy…
View Card →