3,3],[4,4].

Example 2

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

Constraints

1 <= deck.length <= 10^4
0 <= deck[i] < 10^4

Solution

Method 1 – GCD of Counts

Intuition

If all card counts have a common divisor greater than 1, we can partition the deck into groups of that size. The problem reduces to checking if the greatest common divisor (GCD) of all card counts is at least 2.

Approach

Count the frequency of each card value.
Compute the GCD of all frequencies.
If the GCD is at least 2, return true; otherwise, return false.

Code

[{"language":"C+

Related Tags