Subarray with Given Sum Solution

Explanation: Step-by-step: Given the array [6, 5, 4, 3, 2, 1] and target 8, we start a sliding window from the beginning of the array. The initial window is [6]. The sum of this window is 6, which is less than the target. We expand the window by adding the next element, 5. The new window is [6, 5]. The sum of this window is 11, which is greater than the target. However, we need to find the shortest window, so we continue expanding the window. The next element is 4, and the new window is [6, 5, 4]. The sum of this window is 15, which is greater than the target. We can stop here because the window [6, 5, 4] is the shortest window that meets the condition.

Explanation: Step-by-step: Given the array [3, 4, 5, 6, 7, 8] and target 12, we start a sliding window from the beginning of the array. The initial window is [3]. The sum of this window is 3, which is less than the target. We expand the window by adding the next element, 4. The new window is [3, 4]. The sum of this window is 7, which is less than the target. We continue expanding the window. The next element is 5, and the new window is [3, 4, 5]. The sum of this window is 12, which is equal to the target. We can stop here because the window [3, 4, 5] is the shortest window that meets the condition.