DSA Level 1 Basic Data Structures Stacks and Queues Minimum Stack - Constant Space

Minimum Stack - Constant Space

easy

1. You are required to complete the code of our MinStack class. 
2. As data members you've one stack and a min element available in the class. (This is cryptic - take hint from video)
3. Here is the list of functions that you are supposed to complete
      3.1. push -&gt; Should accept new data in LIFO manner.
      3.2. pop -&gt; Should remove and return data in LIFO manner. If not available, print 
       "Stack underflow" and return -1.
      3.3. top -&gt; Should return data in LIFO manner. If not available, print "Stack 
      underflow" and return -1.
     3.4. size -&gt; Should return the number of elements available in the stack.
     3.5. min -&gt; Should return the smallest element available in the stack. If not 
     available, print "Stack underflow" and return -1.
4. Input and Output is managed for you.

Note -&gt; The judge maynot be able to check if all your functions are O(1) in time, but that is what the expectation is. Also, you can only use constant space.r

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

None

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

push 10
push 20
push 5
push 8
push 2
push 4
push 11
top
min
pop
top
min
pop
top
min
pop
top
min
pop
top
min
pop
top
min
pop
top
min
pop
quit

Output

Minimum Stack - I

Queue To Stack Adapter - Push Efficient