When should you use LinkedList in Java?

Using LinkedList is appropriate in the following cases:

1. Frequent insertions and deletions in the middle of the list: Unlike ArrayList, inserting or deleting an element in a LinkedList takes constant time (O(1)), if the element near the insertion/deletion point is known. For ArrayList, this requires shifting elements and takes linear time (O(n)).
2. Implementation of stack or queue: LinkedList provides methods addFirst(), addLast(), removeFirst(), removeLast(), getFirst(), getLast(), making it convenient for implementing these data structures without explicitly managing indices.
3. No need for frequent random access by index: Accessing an element by index in a LinkedList requires traversing the list from the beginning or end, which takes linear time (O(n)). In ArrayList, access takes constant time (O(1)).

Example of implementing a queue using LinkedList:

// Using LinkedList as a queue
import java.util.LinkedList;
import java.util.Queue;

Queue<String> queue = new LinkedList<>();

queue.add("first"); // Add to the end (enqueue)
queue.add("second");
queue.add("third");

System.out.println(queue.peek()); // View the first element without removing
System.out.println(queue.poll()); // Remove and get the first element (dequeue)