Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 914 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 914 # by problem number
lcpy gen -s x_of_a_kind_in_a_deck_of_cards # by problem name
deck where deck[i] represents the number written on the i^th card.
Partition the cards into one or more groups such that:
x cards where x > 1, andtrue if such partition is possible, or false otherwise.
Input: deck = [1,2,3,4,4,3,2,1]
Output: true
[1,1],[2,2],[3,3],[4,4].
Input: deck = [1,1,1,2,2,2,3,3]
Output: false
from collections import Counter
from functools import reduce
from math import gcd
class Solution:
# Time: O(n + k log m) where k is distinct values, m is max count
# Space: O(k)
def has_group_size_x(self, deck: list[int]) -> bool:
counts = list(Counter(deck).values())
return reduce(gcd, counts) > 1
| Time | Space |
|---|---|
| O(n + k log m) where k is distinct values, m is max count | O(k) |