Add Minimum Window Substring algorithm with JUnit tests in Sliding Window package#6552
Closed
Anubhav-pandey004 wants to merge 2 commits intoTheAlgorithms:masterfrom
Closed
Add Minimum Window Substring algorithm with JUnit tests in Sliding Window package#6552Anubhav-pandey004 wants to merge 2 commits intoTheAlgorithms:masterfrom
Anubhav-pandey004 wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
Anubhav-pandey004
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Description
This PR adds an implementation of the Minimum Window Substring problem and its corresponding unit tests under the com.thealgorithms.slidingwindow package.
The algorithm finds the smallest substring in s that contains all characters of t.
Time Complexity: O(n) (where n = length of s)
Space Complexity: O(|charset|) (for frequency hash maps)
Code Summary
Added MinimumWindowSubstring.java
Uses two hash maps (tFreq, windowFreq) and two pointers (left, right) to maintain the sliding window.
Returns the smallest valid substring containing all characters of t, or "" if no window exists.
Added MinimumWindowSubstringTest.java
Includes JUnit tests to validate correctness.
Covers multiple scenarios: basic matches, exact matches, and no-solution cases.