{"date":"2026-09-17","link":"/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/","question":{"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"difficulty":"Medium","acRate":42.05033246359734,"topicTags":[{"name":"Array","slug":"array","nameTranslated":null},{"name":"Hash Table","slug":"hash-table","nameTranslated":null},{"name":"Binary Search","slug":"binary-search","nameTranslated":null},{"name":"Dynamic Programming","slug":"dynamic-programming","nameTranslated":null},{"name":"Sliding Window","slug":"sliding-window","nameTranslated":null}],"content":"

You are given an array of integers arr and an integer target.

\n\n

You have to find two non-overlapping sub-arrays of arr each with a sum equal target. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays is minimum.

\n\n

Return the minimum sum of the lengths of the two required sub-arrays, or return -1 if you cannot find such two sub-arrays.

\n\n

 

\n

Example 1:

\n\n
\nInput: arr = [3,2,2,4,3], target = 3\nOutput: 2\nExplanation: Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.\n
\n\n

Example 2:

\n\n
\nInput: arr = [7,3,4,7], target = 7\nOutput: 2\nExplanation: Although we have three non-overlapping sub-arrays of sum = 7 ([7], [3,4] and [7]), but we will choose the first and third sub-arrays as the sum of their lengths is 2.\n
\n\n

Example 3:

\n\n
\nInput: arr = [4,3,2,6,2,3,4], target = 6\nOutput: -1\nExplanation: We have only one sub-array of sum = 6.\n
\n\n

 

\n

Constraints:

\n\n\n"}}