Stack Algorithms

Implement stack operations with an array and top pointer.

Check if brackets are balanced using a LIFO stack.

Convert infix expression to postfix using Shunting-Yard algorithm.

Check whether the stack has no elements.

Check whether the stack has reached capacity.

Design a stack supporting push, pop, and retrieving minimum in O(1).

Find the first greater element to the right using a monotonic stack.

Read the top stack value without removing it.

Remove the top element from the stack.

Evaluate arithmetic postfix expression using an operand stack.

Add an element to the top of the stack.

Return the number of elements currently in the stack.