How do you implement a stack with push, pop, and min operations in O(1)?

Question Explain

This classic problem requires designing a stack data structure where retrieving the minimum element takes constant time alongside standard stack operations.