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        def Cost(x, y):\n            cost = len(y)\n            max_similarity = 0\n            for i in range(1, min(len(x), len(y))):\n                if x[-i:] == y[:i]: max_similarity = i\n            return cost - max_similarity\n            \n        g = [[float('inf')] * N for _ in range(N)]\n        for i in range(N):\n            for j in range(N):\n                if i != j:\n                    cost = Cost(A[i], A[j])\n                    g[i][j] = cost\n                else: g[i][j] = len(A[i])\n                    \n        dp = [[float('inf')] * N for _ in range(1<<N)]\n        parent = [[-1] * N for _ in range(1<<N)]\n        \n        for i in range(N):\n            dp[1<<i][i] = len(A[i])\n        \n        for s in range(1, 1<<N):\n            for i in range(N):\n                if s & (1<<i):  #valid dp[s][i] check\n                    prev = s - (1<<i)\n                    for j in range(N):\n                        if j != i and prev & (1<<j):\n                            cur_cost = dp[prev][j] + g[j][i]\n                            if cur_cost < dp[s][i]:\n                                dp[s][i] = cur_cost\n                                parent[s][i] = j\n                                \n        min_cost = float('inf')\n        ind = -1\n        last_row = dp[2**N - 1]\n        for i in range(N):\n            if last_row[i] < min_cost:\n                min_cost = last_row[i]\n                ind = i\n        \n        s = 2**N - 1\n        res = A[ind]\n        child_ind = ind\n        # print(s, ind)\n        ind = parent[s][ind]\n        s = s - (1<<child_ind)\n        while s and ind >= 0:\n            cost = g[ind][child_ind]\n            pre_len = len(A[ind]) - len(A[child_ind]) + g[ind][child_ind]\n            res = A[ind][:pre_len] + res\n            child_ind = ind\n            # print(s, ind)\n            ind = parent[s][ind]\n            s = s - (1<<child_ind)\n            \n        return res\n            \n                \n                \n                            \n                    \n            \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: 9144