8.7. When to Use What?

Maintain order, allow duplicates ArrayList or LinkedList

In Java, both ArrayList and LinkedList are used to store collections of elements while maintaining the order of insertion. This means that when you retrieve elements from them, they come out in the same order they were added. The significant difference between them lies in their underlying implementation; ArrayList uses a dynamic array which provides fast access to elements based on their index, while LinkedList uses a doubly linked list which allows for efficient insertion and deletion operations. When you need to maintain the sequence of elements and allow duplicates, either of these options will do.

Think of an ArrayList like a bookshelf with fixed slots for each book, allowing you to quickly get any book you want based on its position. In contrast, a LinkedList is like a chain of linked rooms where each room can easily add or remove books but takes a bit longer to find a specific book.

Remove duplicates HashSet

HashSet is a Java collection that is specifically designed to hold unique elements. This means that when you try to add an element that already exists in the HashSet, it won't be added again. This collection does not maintain any specific order of its elements. It is particularly useful when you want to ensure that no duplicates are present in your data set, like when collecting email addresses, where each address must be unique.

Imagine a party guest list. If a person attempts to RSVP multiple times, you only want their name written down once. The HashSet acts as that guest list, automatically filtering out anyone who tries to sign up more than once.

Store key-value pairs HashMap

HashMap is used to store data in key-value pairs, which means that each value is associated with a specific key. This lets you quickly access values based on their respective keys. Each key must be unique within the HashMap, but multiple keys can point to the same value. This structure is very efficient for look-up operations, allowing you to find values quickly using their keys.

Think of a HashMap like a phone book, where each person’s name (the key) has a corresponding phone number (the value). You can easily look up a person’s name to find their phone number, and you know that each name in the phone book must be unique.

Store sorted unique data TreeSet

A TreeSet is another type of collection that stores unique elements, but it additionally maintains the elements in sorted order. This sorting is based on their natural ordering or a specified comparator. This makes TreeSet useful when you need to keep elements in a specific sequence while also ensuring there are no duplicates among them.

Imagine a library sorting its books by title, ensuring no two books have the same title. A TreeSet works like this library system, keeping each title unique and in alphabetical order for easy browsing.

FIFO operations Queue, LinkedList

For First-In-First-Out (FIFO) operations, where the first element added is the first one to be removed, you can use a Queue or a LinkedList. A Queue is designed specifically for this order of operations, and LinkedList can also simulate this function because of its efficient insertion and deletion properties at both ends of the list. This makes LinkedList an ideal choice when you need to manage a queue of elements.

Think of a line at a bakery. The first person to get in line is the first one to get served. In this queue, everyone has to wait their turn, just like how a FIFO collection operates. Using a LinkedList, you can manage this line effectively, adding people to the back and serving them from the front.

--