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 = "from typing import List\nimport heapq\nimport math\nimport sys\n\n\nclass Solution:\n    def __init__(self):\n        self.preceeding_soln_lens = []\n        self.segment_tree = []\n\n    def has_overlap(self, rng, list_of_ranges):\n        s, e = rng\n        if len(list_of_ranges):\n            os, oe = list_of_ranges[-1]\n            if e < os or oe < s:\n                pass\n            else:\n                return True\n\n        return False\n\n    def find_min(self, s, e):\n        min_val = sys.maxsize\n        for i in range(s, e):\n            if self.preceeding_soln_lens[i]:\n                min_val = min(min_val, self.preceeding_soln_lens[i])\n        if min_val == sys.maxsize:\n            return None\n        return min_val\n\n    def n2_find(self, i, lengths):\n        len_one = self.find_min(0,i)\n        if len_one:\n            len_two = self.find_min(i + len_one - 1, len(self.preceeding_soln_lens))\n            if len_two:\n                heapq.heappush(lengths, len_one+len_two)\n\n    def minSumOfLengths(self, arr: List[int], target: int) -> int:\n        # What's the best I can do ENDING at this index.\n        self.preceeding_soln_lens = [sys.maxsize] * len(arr)\n        min_len_sum = sys.maxsize\n        buffer = []\n        buffer_sum = 0\n        buffer_len = 0\n\n        i = 0\n        # O(N)\n        while i < len(arr):\n            # update state\n            buffer_sum += arr[i]\n            buffer_len += 1\n            buffer.append(i)\n\n            sub_array_end_idx = buffer[-1]\n\n            # check constraint\n            if buffer_sum < target:\n                # copy over the previous one\n                self.preceeding_soln_lens[sub_array_end_idx] = self.preceeding_soln_lens[sub_array_end_idx-1]\n\n            while buffer_sum >= target:\n                popped_idx = buffer.pop(0)\n\n                if buffer_sum == target:\n                    # check for the min\n                    self.preceeding_soln_lens[sub_array_end_idx] = min(buffer_len, self.preceeding_soln_lens[sub_array_end_idx-1])\n\n                    if popped_idx > 0:\n                        non_overlapping_previous_soln_idx = popped_idx - 1\n                        min_len_sum = min(min_len_sum, self.preceeding_soln_lens[non_overlapping_previous_soln_idx] + buffer_len)\n                else:\n                    self.preceeding_soln_lens[sub_array_end_idx] = self.preceeding_soln_lens[sub_array_end_idx-1]\n\n                buffer_len -= 1\n                buffer_sum -= arr[popped_idx]\n\n            i += 1\n\n        if min_len_sum == sys.maxsize:\n            return -1\n        return min_len_sum"
_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: 6120