Given an array of integers arr and an integer target.
You have to find two non-overlapping sub-arrays of arr each with 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.
Return the minimum sum of the lengths of the two required sub-arrays, or return -1 if you cannot find such two sub-arrays.
 
Example 1:
Input: arr = [3,2,2,4,3], target = 3
Output: 2
Explanation: Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.

Example 2:
Input: arr = [7,3,4,7], target = 7
Output: 2
Explanation: 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.

Example 3:
Input: arr = [4,3,2,6,2,3,4], target = 6
Output: -1
Explanation: We have only one sub-array of sum = 6.

Example 4:
Input: arr = [5,5,4,4,5], target = 3
Output: -1
Explanation: We cannot find a sub-array of sum = 3.

Example 5:
Input: arr = [3,1,1,1,5,1,2,1], target = 3
Output: 3
Explanation: Note that sub-arrays [1,2] and [2,1] cannot be an answer because they overlap.

 
Constraints:

1 <= arr.length <= 10^5
1 <= arr[i] <= 1000
1 <= target <= 10^8

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def minSumOfLengthsOld(self, arr: List[int], target: int) -> int:\n        n = len(arr)\n        if n == 1:\n            return -1\n        i = 0\n        j = 0\n        sum_=arr[i]\n        interval = []\n        while i < n and j < n:\n            #print(i,j, sum_)\n            if sum_ == target:\n                interval.append([i,j, (j-i+1)])\n                sum_-=arr[i] \n                i+=1\n                j+=1\n                if j <n:\n                    sum_+=arr[j]\n            elif sum_<target:\n                if j < n-1:\n                    sum_+= arr[j+1]\n                j+=1\n            else:\n                sum_-=arr[i]\n                i+=1\n        if len(interval) == 0:\n            return -1\n        \n        interval.sort(key = lambda x: x[2] )\n        interval_val_sorted = [x for x in interval]\n        interval.sort(key = lambda x: x[0] )\n        \'\'\'\n        for i in range(len(interval)):\n            s, e, val = interval_val_sorted[i][0], interval_val_sorted[i][1], interval_val_sorted[i][2]\n            ind = findCeil(e, interval)\n            if ind == -1:\n                continue\n            val1 = ind[2]\n            return val + val1\n        \'\'\'\n        print(interval_val_sorted )\n        print(interval)\n        i_ , j_, l_ = interval[0][0], interval[0][1], interval[0][2]\n        #l_1 = 0\n        found = False\n        for i in range(1, len(interval), 1):\n            \n            i_1, j_1, l_1 = interval[i][0], interval[i][1], interval[i][2]\n            #print(i_1, j_1)\n            if i_1 >= i_ and i_1 <= j_:\n                continue\n            if i_ >=i_1 and i_ <=j_1:\n                continue\n            found = True\n            break\n        if found == False:\n            return -1\n        return l_ + l_1\n        \n    def findCeil(self, x, starts):\n        s = 0\n        e = len(starts) -1\n        res = -1\n        while s<=e:\n            mid = s+(e-s) // 2\n            if starts[mid] > x:\n                res = mid\n                e = mid -1\n            else:\n                s = mid +1\n        return res\n        \n        \n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n        n = len(arr)\n        i = 0 \n        j = 0\n        overlaps = list()\n        #sum_ = arr[i]\n        sum_= 0\n        j = 0\n        while i < n and j < n:\n    \n            sum_+=arr[j]\n            \n            while j<n-1 and sum_ < target:\n                j+=1\n                #print(j)\n                sum_+= arr[j]\n                \n            #print(\\"B:\\", i,j, sum_)  \n            if sum_ == target:\n                overlaps.append([i, j])\n                \n            sum_-=arr[i]\n            sum_-=arr[j]\n            i+=1\n            #j+=1\n            #print(\\"A:\\", i,j, sum_)\n        if sum_== target:\n            if i <=n-1:\n                overlaps.append([i,j-1])\n        \n        starting = [x for [x,y] in overlaps]\n        length = [y-x+1 for [x,y] in overlaps]\n        l_o = len(length)\n        if l_o == 0:\n            return -1\n        min_arr = [length[-1]]\n        s = 1\n        min_ = length[-1]\n        for i in range(l_o-2, -1, -1):\n            min_ = min(length[i], min_)\n            min_arr.append(min_)\n            \n        min_length = sys.maxsize\n        #print(overlaps)\n        #print(starting)\n        #print(length)\n        #print(min_arr)\n        min_arr = list(reversed(min_arr))\n        for overlap in overlaps:\n            s, e = overlap[0], overlap[1]\n            indi = self.findCeil(e, starting)\n            #print(\\"s,e, indi\\", s, e, indi)\n            if indi == -1:\n                continue\n            min_length = min(min_length, e-s+1 + min_arr[indi])\n            #print(min_length)\n        if min_length == sys.maxsize:\n            return -1\n        \n        return min_length\n                \n            \n        \n        \n            \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'minSumOfLengths'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6836