2206. Divide Array Into Equal Pairs
class Solution: def divideArray(self, nums: List[int]) -> bool: c = Counter(nums) for e in c: if c[e] % 2 != 0: return False return True
Mar 17, 20251 min read3
Command Palette
Search for a command to run...
#counting
Articles tagged with #counting
3223. Minimum Length of String After Operations
class Solution: def minimumLength(self, s: str) -> int: c = Counter(s) def removals(n): if n >= 3: if n % 2 == 0 : return n - 2 return n - 1 return 0 ...
Jan 13, 20251 min read5
1400. Construct K Palindrome Strings
class Solution: def canConstruct(self, s: str, k: int) -> bool: l = len(s) if l < k: return False if l == k: return True c = Counter(s) oddCount = 0 for e in c: ...
Jan 11, 20251 min read2