[НП] - Уникатни имиња

import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

class Names{
    Map<String, Integer> map;

    public Names() {
        this.map = new TreeMap<>(String::compareTo);
    }

    public void addName(String name){
        map.computeIfAbsent(name, (k) -> map.put(name, 0));
        map.put(name, map.get(name)+1);
    }

    public int findUniqueLetters(String name){
        Set<Character> letters = new HashSet<>();
        IntStream.range(0, name.length()).forEach(i -> letters.add(name.toLowerCase().charAt(i)));
        return letters.size();
    }

    public void printN(int n){
        map.keySet().stream()
                .filter(name -> map.get(name) >= n)
                .forEach(name -> System.out.println(String.format("%s (%d) %d", name, map.get(name), findUniqueLetters(name))));
    }

    public String findName(int len, int x){
        ArrayList<String> tmp = (ArrayList<String>) map.keySet().stream().filter(name -> name.length()<len).collect(Collectors.toList());
        if (x >= tmp.size())
            x = x%tmp.size();
        return tmp.get(x);
    }
}
public class NamesTest {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        scanner.nextLine();
        Names names = new Names();
        for (int i = 0; i < n; ++i) {
            String name = scanner.nextLine();
            names.addName(name);
        }
        n = scanner.nextInt();
        System.out.printf("===== PRINT NAMES APPEARING AT LEAST %d TIMES =====\n", n);
        names.printN(n);
        System.out.println("===== FIND NAME =====");
        int len = scanner.nextInt();
        int index = scanner.nextInt();
        System.out.println(names.findName(len, index));
        scanner.close();

    }
}