Stacks

LIFO ordering for tracking nested structure — matching parentheses, undo history, and monotonic sequences.

Q1.What ordering does a stack enforce?

Q2.What is the time complexity of push and pop on a stack implemented with a dynamic array?

Q3.For validating balanced parentheses, what do you push onto the stack?

Q4.What is a monotonic stack primarily used to solve efficiently?