From 1446a31c6414a423029a74366b688ba3c57835be Mon Sep 17 00:00:00 2001 From: Anubhav <110095813+Anubhav-pandey004@users.noreply.github.com> Date: Mon, 29 Sep 2025 16:01:13 +0530 Subject: [PATCH 1/2] Create MinimumWindowSubstringTest.java --- .../MinimumWindowSubstringTest.java | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java diff --git a/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java b/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java new file mode 100644 index 000000000000..1a255eeaae46 --- /dev/null +++ b/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java @@ -0,0 +1,23 @@ +package com.thealgorithms.slidingwindow; + +import static org.junit.jupiter.api.Assertions.assertEquals; + +import org.junit.jupiter.api.Test; + +/** + * Unit tests for the LongestSubstringWithoutRepeatingCharacters class. + * + * @author (https://github.com/Chiefpatwal) + */ +public class MinimumWindowSubstringTest { + + /** + * Tests for the longest subarray with a sum less than or equal to k. + */ + @Test + public void testMinimumWindowSubstring() { + assertEquals(3, MinimumWindowSubstring.minWindow("ADOBECODEBANC","ABC"); // "BANC" + assertEquals(4, MinimumWindowSubstring.minWindow("a","a"); // "a" + assertEquals(2, MinimumWindowSubstring.minWindow("a","aa" // "" + } +} From 06202a656a3c3c831bb12af6eaf0413becced06e Mon Sep 17 00:00:00 2001 From: Anubhav <110095813+Anubhav-pandey004@users.noreply.github.com> Date: Mon, 29 Sep 2025 16:05:30 +0530 Subject: [PATCH 2/2] Update MinimumWindowSubstringTest.java --- .../slidingwindow/MinimumWindowSubstringTest.java | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java b/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java index 1a255eeaae46..e003dfcc264a 100644 --- a/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java +++ b/src/test/java/com/thealgorithms/slidingwindow/MinimumWindowSubstringTest.java @@ -5,19 +5,19 @@ import org.junit.jupiter.api.Test; /** - * Unit tests for the LongestSubstringWithoutRepeatingCharacters class. + * Unit tests for the MinimumWindowSubstring class. * * @author (https://github.com/Chiefpatwal) */ public class MinimumWindowSubstringTest { /** - * Tests for the longest subarray with a sum less than or equal to k. + * Tests for MinimumWindowSubstring.minWindow. */ @Test public void testMinimumWindowSubstring() { - assertEquals(3, MinimumWindowSubstring.minWindow("ADOBECODEBANC","ABC"); // "BANC" - assertEquals(4, MinimumWindowSubstring.minWindow("a","a"); // "a" - assertEquals(2, MinimumWindowSubstring.minWindow("a","aa" // "" + assertEquals(4, MinimumWindowSubstring.minWindow("ADOBECODEBANC", "ABC")); // "BANC" + assertEquals(1, MinimumWindowSubstring.minWindow("a", "a")); // "a" + assertEquals(0, MinimumWindowSubstring.minWindow("a", "aa")); // "" } }