[Sliding Window] Minimum Size Subarray Sum

[sudosf]

Problem

Given an array of positive integers and a target, find the minimal length contiguous subarray whose sum >= target. Return 0 if none exists.

References

• LeetCode: https://leetcode.com/problems/minimum-size-subarray-sum/
• GFG: https://www.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x5651/1
• Sheet: https://www.risingbrain.org/sheet#array (Sliding Window [Two Pointer] 3Sum #6)
• Parent: Pattern: Sliding Window (Arrays) #10

Difficulty

🟡 Medium

Companies

Amazon, Morgan Stanley, Adobe

Notes

Language: Java
Shrink from left as long as sum >= target. Track minimum window length seen.