feat(slidingwindow): add SmallestSubarrayWithSum algorithm #6986
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.
Added a new algorithm SmallestSubarrayWithSum in the slidingwindow package.
It finds the minimum length subarray with sum ≥ target using the sliding window technique.
Runs in O(n) time and O(1) space.
Handles edge cases like empty arrays and single-element subarrays.
Implements clean, modular, and documented code per Checkstyle rules.
Follows TheAlgorithms Java contribution standards.
Enhances the collection of sliding window algorithms.
Useful for interview prep and competitive programming.
Validated locally with mvn checkstyle:check — no style errors.