We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Minimum Distances
  5. Discussions

Minimum Distances

  • jonathandygert
     + 12 comments

    Simple solution in Python 3:

    def minimum_distance(n, A):
    for d in range(1, n):
        for i in range(n - d):
            if A[i] == A[i+d]:
                return d
    return -1

print(minimum_distance(int(input()), [int(x) for x in input().split()]))