[
counter
hash table.
]
BinarySearch 0698 Even Frequency
Problem statement
https://binarysearch.com/problems/Even-Frequency/
Solution
Just do what is asked, using counter.
Complexity
It is O(n)
for time and space.
Code
class Solution:
def solve(self, nums):
return all(x % 2 == 0 for x in Counter(nums).values())