class Solution: def minimumRounds(self, tasks: List[int]) -> int: freq = collections.Counter(tasks) cnt = 0 for num, count in freq.items(): if count = 2: if (count > 2 and count % 2 != 0) or count % 3 == 0: count -= 3 else: count -= 2 cnt += 1 return cnt

class Solution: def digitSum(self, s: str, k: int) -> str: while len(s) > k: i = 0 next = '' while i < len(s): next += str(sum([int(ch) for ch in s[i:min(i + k, len(s))]])) i += k s = next return s

class Solution: def intersection(self, nums: List[List[int]]) -> List[int]: intr = set(nums[0]) for num in nums[1:]: intr = intr & set(num) return sorted(intr)

class Solution: def divideString(self, s: str, k: int, fill: str) -> List[str]: n = len(s) res = [] i = 0 while i < n: pad = k - len(s[i:i + k]) res += s[i:i + k] + fill*pad, i += k return res

class Solution: def minMoves(self, target: int, maxDoubles: int) -> int: cnt = 0 while maxDoubles and target > 1: if target%2: target -= 1 cnt += 1 target //= 2 maxDoubles -= 1 cnt += 1 cnt += target - 1 return cnt

class TrieNode: def __init__(self, ch): self.ch = ch self.child = {} self.eow = False class Solution: def wordCount(self, startWords: List[str], targetWords: List[str]) -> int: cnt = 0 root = TrieNode(None) for start in startWords: node = root for ch in sorted(start): if ch not in node.child: node.child[ch] = TrieNode(ch) node = node.child[ch] node.eow = True for target in targetWords: target = ..