Quick study sessions to strengthen memory and retain key concepts.
Why might you use a PriorityQueue in Java?
PriorityQueue is used when elements need to be processed based on priority. A PriorityQueue orders elements according to…
View Card →Why does choosing LinkedHashSet over HashSet matter in practice?
LinkedHashSet maintains insertion order with slightly more overhead. LinkedHashSet combines the benefits of HashSet with a linked list…
View Card →How do you decide between using HashMap and ConcurrentHashMap?
Use ConcurrentHashMap for thread-safe operations without locking the entire map. HashMap is not synchronized, making it inappropriate for…
View Card →Why does the Map interface in Java matter in this design?
Map represents a collection of key-value pairs. The Map interface is used to store data in key-value pairs,…
View Card →Why might you choose LinkedList over ArrayList?
LinkedList is preferable when frequent insertions and deletions are needed. LinkedList allows constant-time insertions or removals using iterators,…
View Card →What trade-offs does TreeSet have compared to HashSet?
TreeSet maintains sorted order but has higher time complexity than HashSet. TreeSet, unlike HashSet, keeps elements in natural…
View Card →Why is HashMap typically preferred for fast lookup?
HashMap provides average O(1) time complexity for get() and put() operations. HashMap uses a hash table to store…
View Card →How does a List differ from a Set in Java?
A List allows duplicates and maintains order, while a Set does not allow duplicates. A List in Java,…
View Card →How would you explain what 'choose by dominant operation' means in an interview?
Pick the collection that best serves what the code does most often. Collection choice should follow the workload.…
View Card →How should you choose a Java collection?
Choose by the contract and dominant operation: order, uniqueness, lookup, or queueing. Strong collection choices start from what…
View Card →