Skip to content

Design-1 Implemented min-stack #2650

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
PavanKumarBollam wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Design-1 Implemented min-stack #2650

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3e88977
Done Design-1
sureshgoudmula Apr 7, 2026
1c7ae95
Code cleanup
sureshgoudmula Apr 7, 2026
3f57580
code cleanup
PavanKumarBollam Apr 7, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 33 additions & 1 deletion Sample.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,5 +3,37 @@
// Did this code successfully run on Leetcode :
// Any problem you faced while coding this :


// Your code here along with comments explaining your approach
import java.util.Stack;

class MinStack {
Stack<Integer> mainStack;
Stack<Integer> minStack;

public MinStack() {
mainStack = new Stack<>();
minStack = new Stack<>();
}

public void push(int val) {
mainStack.push(val);
if (minStack.isEmpty() || val <= minStack.peek())
minStack.push(val);
}

public void pop() {
int poppedValue = mainStack.pop();
if (poppedValue == minStack.peek())
minStack.pop();
}

public int top() {
return mainStack.peek();
}

public int getMin() {
return minStack.peek();
}
}