Java - LinkedList

LinkedList

import java.util.*;
LinkedList q = new LinkedList<>();
q.addFirst("a"); q.addLast("b");
System.out.println(q.removeFirst());

Prefer ArrayList unless you specifically need frequent inserts/removes at ends.

Try it

1. Use addFirst/addLast to simulate a deque and print after each op.
2. Compare iteration performance of LinkedList vs ArrayList for 100k elements (rough estimate).