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

  • damianourbaniak
     + 0 comments

    Java:

        public static int minimumDistances(List<Integer> a) {
    // Write your code here
        Map<Integer, Integer> occ = new HashMap<>();
        List<Integer> dist = new ArrayList<>();
        
        for (int i = 0; i < a.size(); i++) {
            if (occ.containsKey(a.get(i))) {
                dist.add(Math.abs(occ.get(a.get(i)) - i));
            } else {
                occ.put(a.get(i), i);
            }
        }
        return dist.stream()
        .min(Integer::compareTo)
        .orElse(-1);
    }