X of a Kind in a Deck of Cards
You are given an integer array deck where deck[i] represents the number written on the i^th card.
Partition the cards into one or more groups such that:
- Each group has exactly
xcards wherex > 1. - All the cards in one group have the same integer written on them.
Return true if such partition is possible, or false otherwise.
Example 1
Input
deck = [1,2,3,4,4,3,2,1]Output
truePossible partition [1,1],[2,2],[3,3],[4,4].
Example 2
Input
deck = [1,1,1,2,2,2,3,3]Output
falseNo possible partition.
Constraints
- 1 <= deck.length <= 10^4
- 0 <= deck[i] < 10^4