You are given N elements and your task is to Implement a Stack in which you ement in O(1) can get a minimum time. Answer Example 1: Input: push(2) push(3) pop() getMin() push(1) getMin() Output: 2 1 Explanation: In the first test case for query push(2) Insert 2 into the stack. The stack will be {2} push(3) Insert 3 into the stack. The stack will be {2 3} pop() Remove top element from stack Poped element will be 3 the stack will be {2} getMin() Return the minimum element min element will be 2 push(1) Insert 1 into the stack. The stack will be {2 1} getMin() Return the minimum element min element will be 1.
You are given N elements and your task is to Implement a Stack in which you ement in O(1) can get a minimum time. Answer Example 1: Input: push(2) push(3) pop() getMin() push(1) getMin() Output: 2 1 Explanation: In the first test case for query push(2) Insert 2 into the stack. The stack will be {2} push(3) Insert 3 into the stack. The stack will be {2 3} pop() Remove top element from stack Poped element will be 3 the stack will be {2} getMin() Return the minimum element min element will be 2 push(1) Insert 1 into the stack. The stack will be {2 1} getMin() Return the minimum element min element will be 1.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 21SA
Related questions
Question
35
![You are given N elements and your task
is to Implement a Stack in which you
ement in O(1)
can get a minimum
time.
Answer
Example 1:
Input: push(2) push(3) pop() getMin()
push(1) getMin() Output: 2 1
Explanation: In the first test case for
query push(2) Insert 2 into the stack.
The stack will be {2} push(3) Insert 3
into the stack. The stack will be {2 3}
pop() Remove top element from stack
Poped element will be 3 the stack will
be {2} getMin() Return the minimum
element min element will be 2 push(1)
Insert 1 into the stack. The stack will be
{2 1} getMin() Return the minimum
element min element will be 1.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1b800212-e19b-4278-ac7d-42b00e6385d6%2F3dc32fc3-2ac9-449a-bd86-7e0e2fff9073%2Frhrzxar_processed.png&w=3840&q=75)
Transcribed Image Text:You are given N elements and your task
is to Implement a Stack in which you
ement in O(1)
can get a minimum
time.
Answer
Example 1:
Input: push(2) push(3) pop() getMin()
push(1) getMin() Output: 2 1
Explanation: In the first test case for
query push(2) Insert 2 into the stack.
The stack will be {2} push(3) Insert 3
into the stack. The stack will be {2 3}
pop() Remove top element from stack
Poped element will be 3 the stack will
be {2} getMin() Return the minimum
element min element will be 2 push(1)
Insert 1 into the stack. The stack will be
{2 1} getMin() Return the minimum
element min element will be 1.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning