Find Two Non-overlapping Sub-arrays Each With Target Sum

Find two non-overlapping subarrays of positive integers that each sum to target and return the minimum possible total length of those two subarrays (or -1 if none exist). Because all elements are positive, the problem reduces to locating target-sum windows and combining the best left/right choices using linear scans.