Given a string S, consider all duplicated substrings: (contiguous) substrings of S that occur 2 or more times.  (The occurrences may overlap.)
Return any duplicated substring that has the longest possible length.  (If S does not have a duplicated substring, the answer is "".)
 
Example 1:
Input: "banana"
Output: "ana"

Example 2:
Input: "abcd"
Output: ""

 
Note:

2 <= S.length <= 10^5
S consists of lowercase English letters.

```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 search(self, S, mid) -> str:\n        n = len(S)\n        # convert string to array of integers to implement constant time slice\n        self.nums = [ord(S[i]) - ord('a') for i in range(n)]\n        # base value for the rolling hash function\n        base = 26\n        # mod value for the rolling hash function to avoid overflow\n        MOD = 2**32\n    \n        # compute the hash of string S[:L]\n        hash_ = 0\n        for i in range(mid):\n            hash_ = (hash_ * base + self.nums[i]) % MOD\n              \n        # already visited hashes of strings of length L\n        visited = {hash_}\n        # const value to be used often : a**L % mod\n        aL = pow(base, mid, MOD)\n        for start in range(1, n - mid + 1):\n            # compute rolling hash in O(1) time\n            hash_ = (hash_ * base - self.nums[start - 1] * aL + self.nums[start + mid - 1]) % MOD\n            if hash_ in visited:\n                return start\n            visited.add(hash_)\n        return -1\n        \n    def longestDupSubstring(self, S: str) -> str:\n        n = len(S)\n        # convert string to array of integers to implement constant time slice\n        self.nums = [ord(S[i]) - ord('a') for i in range(n)]\n        # base value for the rolling hash function\n        base = 26\n        # mod value for the rolling hash function to avoid overflow\n        MOD = 2**32\n        \n        # binary search, L = repeating string length\n        left, right = 1, n\n        while left <= right:\n            mid = left + (right - left) // 2\n            if self.search(S, mid) != -1:\n                left = mid + 1\n            else:\n                right = mid - 1\n               \n        start = self.search(S, left - 1)\n        return S[start: start + left - 1]\n    \n    \n    \n    \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestDupSubstring'
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: 7234