Given an array A of strings, find any smallest string that contains each string in A as a substring.
We may assume that no string in A is substring of another string in A.
 

Example 1:
Input: ["alex","loves","leetcode"]
Output: "alexlovesleetcode"
Explanation: All permutations of "alex","loves","leetcode" would also be accepted.


Example 2:
Input: ["catg","ctaagt","gcta","ttca","atgcatc"]
Output: "gctaagttcatgcatc"
 


Note:

1 <= A.length <= 12
1 <= A[i].length <= 20

```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 shortestSuperstring(self, A: List[str]) -> str:\n        n = len(A)\n        w = [[0] * n for _ in range(n)]\n        for i in range(n):\n            for j in range(n):\n                for k in range(min(len(A[i]), len(A[j])), 0, -1):\n                    if A[j].startswith(A[i][-k:]):\n                        w[i][j] = k\n                        break\n        @lru_cache(None)\n        def dp(nodes):\n            if len(nodes) == 2:return A[nodes[0]]\n            end = nodes[-1]\n            end_idx = nodes.index(end) \n            # remove the current ending nodes from nodes[:-1]\n            nodes_wo_end = nodes[:end_idx]+nodes[end_idx+1:-1]\n            # A[end][w[node][end]:] will remove overlap part from the end node.\n            return min((dp(nodes_wo_end +(node, ))+A[end][w[node][end]:]\n                        for node in nodes_wo_end), key=len)\n        return min((dp(tuple(range(n))+(node, )) for node in range(n)), key=len)        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        # n, N = len(A), 1 << len(A)\n        # w = [[0] * n for _ in range(n)]\n        # for i in range(n):\n        #     for j in range(n):\n        #         for k in range(min(len(A[i]), len(A[j])), 0, -1):\n        #             if A[j].startswith(A[i][-k:]):\n        #                 w[i][j] = k\n        #                 break\n        # f = [[None] * n for _ in range(N)]\n        # for i in range(N):\n        #     for k in (t for t in range(n) if (1 << t) & i):\n        #         i1 = i ^ (1 << k)\n        #         f[i][k] = min([f[i1][j] + A[k][w[j][k] :] \n        #                        for j in filter(lambda x: (1 << x) & i1, range(n))],\n        #                        key=len, default=A[k])                              \n        # return min(filter(None, f[-1]), key=len)        \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'shortestSuperstring'
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: 14181