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

  • ali313xA
     + 0 comments
    // Optimized using Hahsh map
// TC: O(n) 
// SC: O(n)

function minimumDistances(a) {
    let hash = {}; // number to its first index 
    let minDist = Infinity; 
    
    for(let i = 0; i < a.length; i++) {
        if(hash[a[i]] !== undefined) {
            minDist = Math.min(minDist, Math.abs(i - hash[a[i]])); 
        }
        else {
            hash[a[i]] = i; 
        }
    }
    
    if(minDist === Infinity) {
        return -1;
    }
    
    return minDist; 
}