Definition

An algorithm to find the shortest contiguous subarray with sum at least a target value. The window size is not fixed but expands/shrinks based on conditions.

Key Characteristics

• ✓Variable-size window - size changes based on conditions
• ✓Expand: sum < target → increase right
• ✓Shrink: sum >= target → increase left, update min length
• ✓O(n) time complexity - each element processed at most twice

Time Complexity