← All problemsSign in

914. X of a Kind in a Deck of Cards

LeetCodeArrayHash TableMathCountingNumber TheoryOpen on judge ↗

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: - Each group has exactly x cards where x > 1, and - 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: true Exp

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start