Given an array of positive integers arr and an integer target.

Find two non overlapping subarrays of arr such that the sum of elements in each subarray is equal to target.

Return the minimum possible sum of the lengths of the two subarrays. If two such subarrays cannot be found, return $-1$.

Constraints:

• $1 \leq$ arr.length $\leq 10^5$

• $1 \leq$ arr[i] $\leq 1000$

• $1 \leq$ target $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.