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 = 'import numpy as np\nclass Solution:\n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n        cumsum = np.cumsum(arr)\n        h2idx = {}\n        \n        print(cumsum)\n        minSum = []\n        for idx,c in enumerate(cumsum):\n            # print(c, target, target-c, h2idx)\n            if c == target: \n                minSum.append(idx+1)\n            if (c - target) in h2idx:\n                minSum.append(idx - h2idx[c - target])\n            h2idx[c] = idx\n        if len(minSum) < 2: return -1\n        return sum(list(sorted(minSum))[:2])\n            \n# t = 7\n# [ 2, 2, 3, 4, 3, 4]\n\n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n        prefix = {0: -1}\n        best_till = [math.inf] * len(arr)\n        ans = best = math.inf\n        for i, curr in enumerate(itertools.accumulate(arr)):\n            if curr - target in prefix:\n                end = prefix[curr - target]\n                if end > -1:\n                    ans = min(ans, i - end + best_till[end])\n                best = min(best, i - end)\n            best_till[i] = best\n            prefix[curr] = i\n        return -1 if ans == math.inf else ans\n    \n    \n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n        cumsum = np.cumsum(arr)\n        h2idx = {}\n        INF = math.inf\n        best_at_i = [INF] * len(arr)\n        best = INF\n        for idx,c in enumerate(cumsum):\n            if c == target: \n                best_at_i[idx] = min(best_at_i[idx-1], idx+1)\n            if (c-target) in h2idx:\n                left = h2idx[c-target]\n                best = min(best, best_at_i[left] + idx - left)\n                best_at_i[idx] = min(best_at_i[left], idx - left)\n            h2idx[c] = idx\n            best_at_i[idx] = min(best_at_i[idx-1], best_at_i[idx])\n            \n        return best if best != INF else -1'
_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: 7927