hazurd

def solution(n, b):
    k = len(n)
    xc = sorted(n, reverse=True)
    yc = sorted(n)
    x = ''.join(xc)
    y = ''.join(yc)
    zc = int(x, base=b) - int(y, base=b)
    z = str_base(zc, b)
    if z in a:
        return len(a) - a.index(z)

hazurd

def solution(x, y):
    unique = None
    work_list = longest([x, y])
    if work_list == x:
        compare_list = y
    else:
        compare_list = x

    for i in work_list:
        if i not in compare_list: