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

Sort by

recency

|

1403 Discussions

|

  • highsoft_soi
     + 0 comments

    C++

    int minimumDistances(vector<int> a) {
    vector<int> distance;
    for (int i = 0; i < a.size(); i++) {
        for (int j = i + 1; j < a.size(); j++){
            if (a[i] == a[j]) {
                distance.push_back(j - i);
            }
        }
    }
    sort(distance.begin(), distance.end());
    return (distance.size() > 0) ? distance[0] : -1;
}

  • aziztuit19
     + 0 comments
    def minimumDistances(a):
    # Write your code here
    list1=[]
    for i in range(len(a)):
        
        for j in range(i+1,len(a)):
            if a[i]==a[j]:
                list1.append(j-i)
    if list1:
        return min(list1)
    else:
        return -1

  • greivin_lopez
     + 0 comments
    def minimum_distances(a):
    minimum = -1
    for i in range(len(a)):
        for j in range(i+1, len(a)):
            if a[i] == a[j]:
                minimum = min(minimum, j-i) if minimum > 0 else j-i
                break
    return minimum

  • afzal_saiyed931
     + 0 comments
    def minimumDistances(a):
    # Write your code here
    
    temp = {}
    min_distance = -1
    
    for i in range(len(a)):
        if a[i] in temp:
            distance = i - temp[a[i]]
            if min_distance == -1 or distance < min_distance:
                min_distance = distance
            temp[a[i]] = i
        else:
            temp[a[i]] = i

    return min_distance

  • yashdeliwala10
     + 0 comments

    //my very simple cpp solutuions//

    int minimumDistances(vector a) {

    vector<int>b;
bool flag =1;

for(int i = 0;i < a.size();i++){
    { int count;
        for(int j=i+1;j < a.size();j++){
            if(a[i] ==a[j]){
                count=abs(j - i);
                 flag=0;
            }
        }b.push_back(count);
    }
}
if(flag == 1){
    return -1;
}

int min=b[0];
for(int i = 0;i < b.size();i++){
    if(b[i] < min){
        min=b[i];
    }
}

return min;

    }