Python (Simple Hashmap)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def countExcellentPairs(self, nums, k):\n        nums, count, dict1 = set(nums), 0, defaultdict(int)\n\n        for i in nums:\n            dict1[bin(i)[2:].count("1")] += 1 \n\n        for k1,v1 in dict1.items():\n            for k2,v2 in dict1.items():\n                if k1 + k2 >= k:\n                    count += v1*v2 \n\n        return count \n```
['Python3']