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...
#hashmap
Articles tagged with #hashmap
2657. Find the Prefix Common Array of Two Arrays
class Solution: def findThePrefixCommonArray(self, A: List[int], B: List[int]) -> List[int]: matchCount = 0 n = len(A) c = [0] * n aSet = set() bSet = set() for i in range(n): if A[i] i...
Jan 14, 20251 min read2
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