Solving Minimum Size Subarray Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

Follow up:

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

See the full details of the problem Minimum Size Subarray Sum at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go