Content-Length: 326446 | pFad | http://github.com/TheAlgorithms/Java/pull/6387/commits/db3a052c0e208e5b6166c5ac39fa9c7471dfb252

01 testing: added unit tests for the `MinStackUsingTwoStacks` by alxkm · Pull Request #6387 · TheAlgorithms/Java · GitHub
Skip to content

testing: added unit tests for the MinStackUsingTwoStacks #6387

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.

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

Merged
Merged
Changes from 1 commit
Commits
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
Next Next commit
testing: added unit tests for the MinStackUsingTwoStacks
  • Loading branch information
alxkm committed Jul 14, 2025
commit db3a052c0e208e5b6166c5ac39fa9c7471dfb252
Original file line number Diff line number Diff line change
@@ -1,38 +1,112 @@
package com.thealgorithms.stacks;

import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertThrows;

import org.junit.jupiter.api.Test;
import java.util.EmptyStackException;

public class MinStackUsingTwoStacksTest {

@Test
public void testMinStackOperations() {
public void testBasicOperations() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(3);
minStack.push(5);
assertEquals(3, minStack.getMin());
assertEquals(3, minStack.getMin(), "Min should be 3");

minStack.push(2);
minStack.push(1);
assertEquals(1, minStack.getMin());
assertEquals(1, minStack.getMin(), "Min should be 1");

minStack.pop();
assertEquals(2, minStack.getMin());
assertEquals(2, minStack.getMin(), "Min should be 2 after popping 1");

assertEquals(2, minStack.top(), "Top should be 2");
}

@Test
public void testPushDuplicateMins() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(2);
minStack.push(2);
minStack.push(1);
minStack.push(1);
assertEquals(1, minStack.getMin(), "Min should be 1");

minStack.pop();
assertEquals(1, minStack.getMin(), "Min should still be 1 after popping one 1");

minStack.pop();
assertEquals(2, minStack.getMin(), "Min should be 2 after popping both 1s");

minStack.pop();
assertEquals(2, minStack.getMin(), "Min should still be 2 after popping one 2");

minStack.pop();
// Now stack is empty, expect exception on getMin
assertThrows(EmptyStackException.class, minStack::getMin);
}

@Test
public void testMinStackOperations2() {
public void testPopOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::pop);
}

@Test
public void testTopOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::top);
}

@Test
public void testGetMinOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::getMin);
}

@Test
public void testSingleElementStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(10);
assertEquals(10, minStack.getMin());
assertEquals(10, minStack.top());

minStack.pop();
assertThrows(EmptyStackException.class, minStack::getMin);
}

@Test
public void testIncreasingSequence() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(1);
minStack.push(2);
minStack.push(3);
minStack.push(5);
assertEquals(3, minStack.getMin());
minStack.push(4);

assertEquals(1, minStack.getMin());
assertEquals(4, minStack.top());

minStack.pop();
minStack.pop();
assertEquals(1, minStack.getMin());
assertEquals(2, minStack.top());
}

@Test
public void testDecreasingSequence() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(4);
minStack.push(3);
minStack.push(2);
minStack.push(1);

assertEquals(1, minStack.getMin());
assertEquals(1, minStack.top());

minStack.pop();
assertEquals(2, minStack.getMin());
assertEquals(2, minStack.top());
}
}
Loading








ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://github.com/TheAlgorithms/Java/pull/6387/commits/db3a052c0e208e5b6166c5ac39fa9c7471dfb252

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy