LeetCode 914. X of a Kind in a Deck of Cards

In a deck of cards, each card has an integer written on it.

Return true if and only if you can choose X >= 2 such that it is possible to split the entire deck into 1 or more groups of cards, where:

Each group has exactly X cards.
All the cards in each group have the same integer.

Example 1:
Input: [1,2,3,4,4,3,2,1]
Output: true
Explanation: Possible partition [1,1],[2,2],[3,3],[4,4]

Example 2:

Input: [1,1,1,2,2,2,3,3]
Output: false
Explanation: No possible partition.

Example 3:

Input: [1]
Output: false
Explanation: No possible partition.

Example 4:

Input: [1,1]
Output: true
Explanation: Possible partition [1,1]

Example 5:

Input: [1,1,2,2,2,2]
Output: true
Explanation: Possible partition [1,1],[2,2],[2,2]

Note:
1 <= deck.length <= 10000
0 <= deck[i] < 10000

solution can look at the comments in the code

class Solution {
    public boolean hasGroupsSizeX(int[] deck) {
        HashMap<Integer, Integer> map = new HashMap<>();
        //count the frequency of each card
        for (int i = 0; i < deck.length; i++) {
            map.put(deck[i], map.getOrDefault(deck[i], 0) + 1);
        }
        //get the card with smallest frequency
        int minCount = Integer.MAX_VALUE;
        for (Integer key : map.keySet()) {
            minCount = Math.min(minCount, map.get(key));
        }
        //find if minCount and other frequency has common same factor
        if (minCount < 2) {
            return false;
        } else {
            for (Integer key : map.keySet()) {
                int factor = getLargestCommonFactor(map.get(key), minCount);
                if (factor < 2) return false;
                minCount = factor;
            }
        }
        return true;
    }
    public static int getLargestCommonFactor(int n, int m) {
        while (n % m != 0) {
            int x = n % m;
            n = m;
            m = x;
        }
        return m;
    }
}