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 846 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 846 # by problem number
lcpy gen -s hand_of_straights # by problem name
groupSize, and consists of groupSize consecutive cards.
Given an integer array hand where hand[i] is the value written on the i<sup>th</sup> card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.
Input: hand = [1,2,3,6,2,3,4,7,8], groupSize = 3
Output: true
Explanation: Alice's hand can be rearranged as [1,2,3],[2,3,4],[6,7,8]
Input: hand = [1,2,3,4,5], groupSize = 4
Output: false
Explanation: Alice's hand can not be rearranged into groups of 4.
from collections import Counter
class Solution:
# Time: O(n log n)
# Space: O(n)
def is_n_straight_hand(self, hand: list[int], group_size: int) -> bool:
if len(hand) % group_size != 0:
return False
count: Counter[int] = Counter(hand)
for card in sorted(count):
if count[card] == 0:
continue
frequency = count[card]
# Greedily form `frequency` groups starting at `card`
for offset in range(group_size):
next_card = card + offset
if count[next_card] < frequency:
return False
count[next_card] -= frequency
return True
| Time | Space |
|---|---|
| O(n log n) | O(n) |