Number of Excellent Pairs LeetCode solution in Python

1
# Runtime: 2052 ms (Top 44.44%) | Memory: 32.2 MB (Top 22.19%)
2

3

4
class Solution:
5
    def countExcellentPairs(self, nums: List[int], k: int) -> int:
6
        hamming = sorted([self.hammingWeight(num) for num in set(nums)])
7
        ans = 0
8
        for h in hamming:
9
            ans += len(hamming) - bisect.bisect_left(hamming, k - h)
10
        return ans
11

12
    def hammingWeight(self, n):
13
        ans = 0
14
        while n:
15
            n &= n - 1
16
            ans += 1
17
        return ans