Leetcode Problem 914. X of a Kind in a Deck of Cards

914. X of a Kind in a Deck of Cards

Leetcode Solutions

Approach: Greatest Common Divisor

  1. Create a hash map to count the frequency of each card number in the deck.
  2. Initialize a variable gcd to -1 to store the greatest common divisor of the counts.
  3. Iterate over the hash map and update gcd with the GCD of gcd and the current count using a GCD helper function.
  4. If at any point gcd becomes 1, return false as we cannot partition the deck.
  5. After the iteration, if gcd is greater than 1, return true. Otherwise, return false.
UML Thumbnail

Approach: Brute Force

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...