GTE

TitleSearch.java

public class TitleSearch {
  public static void main(String[] args) {
    final Scanner sc = new Scanner(System.in);

    List<String> titles = new ArrayList<>();
    final int n = sc.nextInt();
    sc.nextLine();
    for (int i = 0; i < n; ++i) {
      titles.add(sc.nextLine());
    }

    List<String> queries = new ArrayList<>();
    final int q = sc.nextInt();
    sc.nextLine();
    for (int i = 0; i < q; ++i) {
      queries.add(sc.nextLine());
    }
        solve(titles, queries);
    }

  static void solve(List<String> titles, List<String> queries) {
        Map<String, List<HashSet<String>>> tr = new HashMap<>();

        for (String title : titles) {
            String[] keywordsArr = title.toLowerCase().split(" ");
            HashSet<String> keywordsSet = new HashSet<>(Arrays.asList(keywordsArr));
            keywordsArr = null;

            // List to handle duplicated titles
            tr.computeIfAbsent(title, t -> new ArrayList<>()).add(keywordsSet);
        }

        PriorityQueue<String> results = new PriorityQueue<>((a, b) -> {
            int result = a.split(" ").length - b.split(" ").length;
            if (result == 0) {
                return a.compareTo(b);
            }
            return result;
        });

        for (String query : queries) {
            String[] keywordsArr = query.toLowerCase().split(" ");
            TreeSet<String> keywordsSet = new TreeSet<>();
            for (int i = 0; i < keywordsArr.length; i++) {
                keywordsSet.add(keywordsArr[i]);
            }
            keywordsArr = null;

            tr.forEach((i, k) -> {
                k.forEach(t -> {
                    if (t.containsAll(keywordsSet)) {
                        results.add(i);
                    }
                });
            });

            System.out.println(Math.min(10, results.size()));
            for (int i = 0; i < 10; i++) {
                String title = results.poll();
                if (title == null) break;
                System.out.println(title);
            }
        }
    }
}