Dsa
Bit Manipulation
Medium
Unique Binary Representations
Given a list of integers, determine the number of unique binary representations of those integers when padded to the length of the longest number in binary.
Input format:
The first line contains an integer n (1 <= n <= 1000), the count of numbers.
The second line contains n space-separated integers.
Output format:
Print a single integer, the count of unique binary representations.
Example:
Input: 4
1 2 3 4
Output: 3
Key concepts
bit_manipulationunique_counts
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