What are some performance trade-offs when choosing between different collections?

Short answer: Scenario Best Choice Trade-offs Fast indexed access List<T> Slower inserts/removes in the middle Frequent insert/delete at ends LinkedList<T> No fast indexed access; higher memory use Fast lookups by key Dictionary<TKey, TValue> No sorted order Sorted key-value pairs SortedList<TKey, TValue> or SortedDictionary<TKey, TValue> Slower inserts vs Dictionary Thread-safe multi-thread use ConcurrentDictionary /…

Explain a bit more

ConcurrentQueue Slight overhead for synchronization

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.