Envío 4917

Código

import java.util.*; 

//map > a:2, b:1, c:1

public class Main {
    public static void main(String[] args) {
        // Substring más corta con mínimo K caracteres diferentes
        // "abaca"
        // 3 -> 3
        Scanner scanner = new Scanner(System.in);
        final String input = scanner.next();
        final int k = scanner.nextInt();
        
        //Solution here boy
        int result = Integer.MAX_VALUE;
        int i = 0;
        final Map<Character, Integer> freqMap = new HashMap<>();
        
        for(int j = 0; j < input.length(); j++) {
            char rightChar = input.charAt(j);
            freqMap.put(rightChar, freqMap.getOrDefault(rightChar, 0) + 1);
            while(freqMap.size() >= k) {
                char leftChar = input.charAt(i);
                freqMap.put(leftChar, freqMap.getOrDefault(leftChar, 0) - 1);
                if(freqMap.get(leftChar) == 0) {
                    freqMap.remove(leftChar);
                }
                result = Math.min(result, j - i + 1);
                i++;
            }
            
        }
        
        System.out.println(result == Integer.MAX_VALUE ? -1 : result);
        scanner.close();
    }
}