Custom Stack Min-Element

Function Name: getMinFromStack

Description

Write a function that, when implemented, operates a stack data structure allowing push and pop operations, but also includes a function to retrieve the smallest element in the stack at any given time. The stack should only store integers.

The getMinFromStack function should work in constant time and with O(1) memory, meaning you should not use any additional data structures to keep track of the minimum element.

Push and pop operations should also work in constant time (O(1)). This will require designing the stack in such a way that it can keep track of the minimum element as elements are pushed and popped.

Requirements

• The function should have three methods associated with it: push, pop, and getMin.
• push(int val): Inserts a value onto the stack.
• pop(): Removes the value on top of the stack and returns it. If the stack is empty, return an exception or error message.
• getMin(): Returns the smallest element from the stack without removing it. If the stack is empty, return an exception or error message.
• All operations should be performed in O(1) time.

Examples

Let stack = getMinFromStack()stack.push(5)stack.getMin() // returns 5stack.push(3)stack.getMin() // returns 3stack.pop() // returns 3stack.getMin() // returns 5

Links