How does a Stack<T> work internally?

Short answer: Internally, Stack<T> uses an array-based dynamic storage system: When capacity is exceeded, the internal array resizes automatically (typically doubles) The top of the stack is managed with a private index pointer This structure provides fast push and pop operations (constant time on average).

Real-world example (ShopNest)

ShopNest uses a Queue<Order> for “orders waiting for payment confirmation,” and a Stack<Uri> for back-navigation in the admin UI.

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.