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

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/H8aBskFE2XI

    int minimumDistances(vector<int> a) {
    map<int, int>mp;
    int result = 1000;
    for(int i = 0; i < a.size(); i++){
        if(mp[a[i]]){
            result = min(result, i + 1 - mp[a[i]]);
        }
        mp[a[i]] = i+1;
    }
    return (result == 1000) ? -1:result;
}