X of a Kind in a Deck of Cards - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
914. X of a Kind in a Deck of Cards
Easy
10 Points
Array
Hash Table
Math
Counting
Number Theory
You are given an integer array deck where deck[i] represents the number written on the ith card.
Partition the cards into one or more groups such that:
Return true if such partition is possible, or false otherwise.
Examples
Example 1
Input: deck = [1,2,3,4,4,3,2,1]
Output: true
Explanation: Possible partition [1,1],[2,2],[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 <= 104
0 <= deck[i] < 104
914. X of a Kind in a Deck of Cards
Easy
10 Points
Array
Hash Table
Math
Counting
Number Theory
You are given an integer array deck where deck[i] represents the number written on the ith card.
Partition the cards into one or more groups such that:
Return true if such partition is possible, or false otherwise.
Examples
Example 1
Input: deck = [1,2,3,4,4,3,2,1]
Output: true
Explanation: Possible partition [1,1],[2,2],[3,3],[4,4].
Example 2
Input: deck = [1,1,1,2,2,2,3,3]
Output: false
Explanation: No possible partition.