• + 0 comments

    Here is my Python solution!

    def minimumDistances(a):
        distances = []
        if len(a) == len(set(a)):
            return -1
        for num in range(len(a)):
            if a[num] in a[num + 1:]:
                distances.append(abs(num - (a[num + 1:].index(a[num]) + num + 1)))
        return min(distances)