A HashSet<T> holds each value once and answers Contains in constant time. Add returns false when the value was already there, which makes spotting duplicates a one-liner. Like dictionaries, sets take a comparer: new HashSet<string>(StringComparer.OrdinalIgnoreCase).
A Queue<T> is first in, first out: Enqueue adds at the back and Dequeue takes from the front, like a line at a counter. A Stack<T> is last in, first out: Push and Pop, like an undo history. Calling Dequeue or Pop on an empty collection throws InvalidOperationException, so check Count, or use TryDequeue and TryPop.
Choosing the right collection often removes a loop: a set replaces "have I seen this?" scans, and a queue keeps arrival order without index bookkeeping.
A set for "seen it?", a queue for arrival order, a stack for undo.