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 getArraysx (self, arr,target):\n        leftSizes = {}\n        rightSizes = {}  #include start-range\n        posleft = 0\n        posright = 0\n        currSum = 0\n        while  posright < len(arr):\n            currSum += arr[posright]\n            if currSum  == target:\n                #update rifht of i, including i\n                rightList = rightSizes.get(posleft,[])\n                rightList.append(posright-posleft + 1)\n                rightSizes[posleft] = rightList\n                #update left of i, not including i\n                if (posright +1 < len(arr)):\n                    leftList = leftSizes.get(posright+1,[])\n                    leftList.append(posright-posleft + 1)\n                    leftSizes[posright+1]=leftList\n                #move pointers to the right\n                posright +=1\n                currSum -= arr[posleft]\n                posleft +=1\n            elif currSum  > target:\n                #remove leftmost element \n                currSum =  currSum - arr[posright] - arr[posleft] \n                posleft +=1\n            else: #currSum < target\n                #include current element move right pointer\n                posright +=1\n        #print ('left', leftSizes)   \n        #print('right', rightSizes)\n        leftArray = [0]*len(arr)\n        fullList = []\n        for i in range(len(arr)):\n            additional = leftSizes.get(i,[])\n            fullList.extend(additional)\n            if len(fullList) > 0:\n                leftArray[i] = min(fullList)\n            else:\n                leftArray[i] = -1\n            \n        rightArray = [0]*len(arr)\n        fullList = []\n        for j in range(len(arr)-1, -1,-1):\n            additional = rightSizes.get(j,[])\n            fullList.extend(additional)\n            if len(fullList) > 0:\n                rightArray[j] = min (fullList)\n            else:\n                rightArray[j] = -1\n                \n        return leftArray, rightArray\n    \n    def updateArrays (self, leftSizes, rightSizes, posleft, posright,maxvalue):\n        # 3 4 5\n        # 1 3 2.    target = 6\n        # update i  =3  for right or equal of 3\n        # update i = 6 for left of 6\n        \n        #update rifht of i, including i\n        value = rightSizes.get(posleft,maxvalue)\n        rightSizes[posleft] = min (value,posright-posleft + 1 )\n        #update left of i, not including i\n        if posright +1 < maxvalue:\n            value = leftSizes.get(posright+1,maxvalue)\n            leftSizes[posright+1]=min (value,posright-posleft + 1  )\n    \n    def getArrays (self, arr,target):\n        leftArray = [0]*len(arr)\n        rightArray = [0]*len(arr)\n        leftSizes = {}\n        rightSizes = {}  #include start-range\n    \n        posleft = 0\n        posright = 0\n        currSum = 0\n        while  posright < len(arr):\n            currSum += arr[posright]\n            if currSum  == target:\n                self.updateArrays(leftSizes,rightSizes, posleft, posright, len(arr))\n                #move pointers to the right\n                posright +=1\n                currSum -= arr[posleft]\n                posleft +=1\n            elif currSum  > target:\n                #remove leftmost element \n                currSum =  currSum - arr[posright] - arr[posleft] \n                posleft +=1\n            else: #currSum < target\n                #include current element move right pointer\n                posright +=1\n        #print ('left', leftSizes)   \n        #print('right', rightSizes)\n        leftArray = [len(arr)]*len(arr)\n        for i in range(1,len(arr)):\n            minValue = leftSizes.get(i,len(arr))\n            leftArray[i] = min(minValue, leftArray[i-1])\n            \n        rightArray = [len(arr)]*len(arr)\n        for j in range(len(arr)-1, -1,-1):\n            minValue = rightSizes.get(j,len(arr))\n            if j == len(arr)-1:\n                rightArray[j] = minValue\n            else:    \n                rightArray[j] = min (minValue, rightArray[j+1])\n\n                \n        return leftArray, rightArray\n    \n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n\n        leftArray, rightArray = self.getArrays ( arr,target)\n        #print ('left', leftArray)\n        #print ('right', rightArray)  \n        #process hashmaps by i position\n        minSum = 2*len(arr)\n        for i in range (1,len(arr)):\n            if leftArray[i] < len(arr):\n                leftSize = leftArray[i]\n            else:\n                continue\n            if rightArray[i] < len(arr):\n                rightSize = rightArray[i]\n            else:\n                continue\n            #print (i, leftSize, rigthSize)\n            minSum = min(minSum, leftSize + rightSize)\n        if minSum == 2*len(arr):\n            minSum = -1\n        return minSum\n            \n                \n\n            \n        \n        \n    def minSumOfLengthsx(self, arr: List[int], target: int) -> int:\n        #two pointers \n        #loop until sum = target or > target\n        #if greather than target, move posleft one to the right \n\n        #keep array of lenghts and get the samllet two (this can be optimized)\n        #or get subarrays, even if they overlap, and then choose the smalles when overalp \n        \n        posleft = 0\n        posright = 0\n        lengths = [] # keeping two smallest?\n        currSum = 0\n        while  posright < len(arr):\n            currSum += arr[posright]\n            #`print (posleft, posright, currSum)\n            if currSum  == target:\n                lengths.append(posright-posleft + 1)\n                posright +=1\n                posleft = posright\n                currSum = 0\n                #if posright < len(arr):\n                #   currSum = arr[posright]\n                \n            elif currSum  > target:\n                #remove leftmost element \n                currSum =  currSum - arr[posright] - arr[posleft] \n                posleft +=1\n            else:\n                #include current element move right pointer\n                posright +=1\n                #if posright < len(arr):\n                #    currSum += arr[posright]\n        print(lengths)\n        if len(lengths) < 2:\n            return -1\n        lengths.sort()\n        return sum(lengths[0:2])\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: 7644