Implement stack-based algorithms and data structures

Create implementations for stack-based algorithms and data structures:

## Basic implementations:
- Stack implementation using arrays
- Stack implementation using linked lists
- Min stack with O(1) operations
- Stack with queue operations in O(1)

## Classic stack problems:
- Next greater element
- Valid parentheses
- Evaluate postfix expression
- Convert infix to postfix/prefix
- Implement calculator
- Largest rectangle in histogram
- Stock span problem
- Celebrity problem

## Requirements:
- Provide detailed complexity analysis
- Create comprehensive test cases
- Include practical applications
- Document advantages/disadvantages of different implementations

This collection will demonstrate fundamental stack operations and their applications in algorithm design.

The issue names no files or existing tests; first inspect the repository's Hy algorithm and data-structure layout and its current testing conventions. Implement the listed stack structures and problems, with complexity analysis, comprehensive tests, practical applications, and implementation trade-offs documented when all requirements are covered.

Written by the indexing model from the issue text.