Problem 2.Sets of Elements

 Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        Set<Integer> setN = new LinkedHashSet<>();
        for (int i = 0; i < n; i++) {
            setN.add(scanner.nextInt());
        }
        Set<Integer> setM = new LinkedHashSet<>();
        for (int i = 0; i < m; i++) {
            setM.add(scanner.nextInt());
        }
        List<Integer> equalsNum = new ArrayList<>();
        boolean lowestNum = true;
        int checkLowNum = 0;
        if (n < m) {
            checkLowNum = n;
            lowestNum = false;
        } else if (n > m) {
            checkLowNum = m;
        } else {
            checkLowNum = n;
            lowestNum = false;
        }


        if (checkLowNum == n && !lowestNum) {
            addEqualsNumToList(setN, setM, equalsNum);
        } else {
            addEqualsNumToList(setM, setN, equalsNum);
        }

        Set<Integer> result = new LinkedHashSet<>();
        for (int i = 0; i < equalsNum.size(); i++) {
            result.add(equalsNum.get(i));

        }

        System.out.println(result.toString().replaceAll("[\\[\\],]", ""));
    }

    private static void addEqualsNumToList(Set<Integer> setLow, Set<Integer> setBigest, List<Integer> equalsNum) {

        int length = setLow.size();
        for (int i = 0; i < length; i++) {
            int numEquals = setLow.iterator().next();
            setLow.remove(numEquals);
            if (setBigest.contains(numEquals)) {
                equalsNum.add(numEquals);
            }
        }
    }

}