Minimum Size Subarray Sum

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn’t one, return 0 instead.

Latest Source Code:
Github: MinimumSizeSubArraySum.java

Output:

Array: [2, 3, 1, 2, 4, 3]
S: 7
Minimum Sum Size: 2
Minimum Sum Size: 2