Unique Bit Count

Given an integer array, determine the number of unique integers in the array that have a different number of 1 bits in their binary representation. Output a single integer that represents this count. Example: Input: 5 7 3 7 5 6 Output: 4 (Multiple occurrences of the same integer do not count towards unique counts.)

Key concepts

bit_manipulationunique_elements

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now

Part of Praxari's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.