Solving X of a Kind in a Deck of Cards in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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

  • All the cards in each group have the same integer.

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]
Explanation: No possible partition.

Example 3:

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

Example 4:

Input: deck = [1,1]
Output: true
Explanation: Possible partition [1,1].

Example 5:

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

Constraints:

  • 1 <= deck.length <= 10^4

See the full details of the problem X of a Kind in a Deck of Cards at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go